Skip to main content
Back to problems
#643
Easy Algorithms

Maximum average subarray i

Array Sliding Window
47.1% acceptance
Feb 20, 2026
4341
385
Find a contiguous subarray of length k with maximum average value.

Solution

Rust
Time O(n)
Space O(1)
LeetCode
solution.rs
impl Solution {
  pub fn find_max_average(nums: Vec<i32>, k: i32) -> f64 {
    let k = k as usize;
    let mut sum: i32 = nums[..k].iter().sum();
    let mut max_sum = sum;
    for i in k..nums.len() {
      sum += nums[i] - nums[i - k];
      max_sum = max_sum.max(sum);
    }
    max_sum as f64 / k as f64
  }
}