Problem - Maximum Average Subarray

Given an integer array $nums$ and an integer $k$, find the contiguous subarray of length $k$ that has the maximum average value.

You're looking at the simplest fixed-window problem. You maintain the sum of the current window. When sliding, add the new element and subtract the old one. Read the problem. The constraints allow $O(n)$ but not $O(nk)$.