Maximum Average Subarray I
Updated Jan 31, 2026
Problem
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.
Constraints
n == nums.length
1 <= k <= n <= 10^5
-10^4 <= nums[i] <= 10^4
Examples
Example 1
Input:
nums = [1,12,-5,-6,50,3], k = 4
Output:
12.75
Maximum average is (12 + -5 + -6 + 50) / 4 = 51 / 4 = 12.75
Example 2
Input:
nums = [5], k = 1
Output:
5.0
Function Signature
def findMaxAverage(self, nums: list[int], k: int) -> float
How to Submit
Implement a Solution class with a findMaxAverage method.
Your method will be called with the input parameters and should return the answer.