Search
⌘K
Leetcode 643. Maximum Average Subarray I
Given an array nums and an integer k, return the maximum average of any contiguous subarray of length k. This is a classic sliding-window problem solvable in O(n) time (n up to 1e5).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.