Problem
Ask
Submissions

Problem: Maximum Average Subarray I

Medium
30 min
Explore the sliding window technique to solve the maximum average subarray problem. Learn to efficiently compute the highest average of any contiguous subarray of given length, improving speed and space complexity in your code.

Statement

Given an array of integers nums, and an integer k, return the maximum average of a contiguous subarray of length k.

Constraints:

  • 11 \leqk \leq nums.length \leq 10510^5

  • 104-10^4 \leqnums[i] 104\leq 10^4

Problem
Ask
Submissions

Problem: Maximum Average Subarray I

Medium
30 min
Explore the sliding window technique to solve the maximum average subarray problem. Learn to efficiently compute the highest average of any contiguous subarray of given length, improving speed and space complexity in your code.

Statement

Given an array of integers nums, and an integer k, return the maximum average of a contiguous subarray of length k.

Constraints:

  • 11 \leqk \leq nums.length \leq 10510^5

  • 104-10^4 \leqnums[i] 104\leq 10^4