Practice Maximum Average Subarray I
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
You are given an integer array nums consisting of n elements, and an integer k. Find a contiguous subarray whose length is equal to k that has the maximum average value and return this value. Any answer with a calculation error less than 10^-5 will be accepted.
Source: Maximum Average Subarray I on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
nums = [1,12,-5,-6,50,3], k = 4
Output
12.75000
# Example 2
Input
nums = [5], k = 1
Output
5.00000
Constraints
n == nums.length
1 <= k <= n <= 10^5
-10^4 <= nums[i] <= 10^4
Related LeetCode Problems
Practice more problems similar to Maximum Average Subarray I.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.