#990Easy#39 in TCS's list· asked at 9 companies
Maximum Average Subarray I
Hosted on LeetCode
Solve it on LeetCode, track it here.
This problem's full statement lives on LeetCode. Open it in a new tab, then come back to mark it solved, add notes and keep your streak.
LeetCode Premium locked?
Most company-tagged LeetCode problems are behind Premium. If you have ChatGPT Plus or Claude Pro, ask it for the full statement, examples and constraints. The buttons below open a chat with the prompt already filled in.
What we know
Example 1
Input: nums = [1,12,-5,-6,50,3], k = 4 Output: 12.75000
(12 - 5 - 6 + 50) / 4 = 12.75.
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