Solution: Maximum Average Subarray I
Understand how to apply the sliding window technique to find the maximum average of a contiguous subarray in an integer array. This lesson guides you through calculating sums efficiently by sliding over the array and updating the max sum, achieving an O(n) time and O(1) space solution.
We'll cover the following...
We'll cover the following...
Statement
Given an array of integers nums, and an integer k, return the maximum average of a contiguous subarray of length k.
Constraints:
...