max-avg-sliding-window-o-n

Status: IN

The maximum average subarray solution runs in O(n) time and O(1) extra space by maintaining a running sum and sliding a fixed-size window.

Source: entries/2026/06/06/maximum-average-subarray-i-solution.md

JSON