Problem 643 · Easy

Maximum Average Subarray I

Find the maximum average of any run of exactly k neighbouring values. The visual slides a window across the array, adding the new value and dropping the old one.

Open the interactive visualisation