#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/fundamental-algorithms/sliding-window/fixed-window-example

░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░███████████████████████████████████████████████████████████████████████████████████████

#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/fundamental-algorithms/sliding-window/fixed-window-example

Repovive

Fixed Window - Example - Sliding Window | Fundamental Algorithms | Repovive

Repovive.

Fundamental Algorithms8 sections · 294 units2h total

Open in Course

Fixed Window - Example

Maximum average subarray of length k.

Problem: Max average of $k$ consecutive elements.

function findMaxAverage(nums, k):
    windowSum = sum of nums[0..k-1]
    maxSum = windowSum
    for i from k to nums.length - 1:
        windowSum = windowSum + nums[i] - nums[i-k]
        maxSum = max(maxSum, windowSum)
    return maxSum / k

Example: $[1,12,-5,-6,50,3]$ , $k=4$ . Sums: $2, 51, 42$ . Max $= 51$ . Avg $= 12.75$ .

Time: $O(n)$ . Space: $O(1)$ .