Sliding Window Maximum

Monotonic Dominance

To find the max in O(n), use a Deque to store indices. Maintain the deque so that the elements are in descending order.

The Assignment

Your function receives nums and k.

1. Iterate through nums.
2. Remove indices from the front that are out of the window (< i - k + 1).
3. Remove indices from the back whose values are smaller than the current value (nums[i]).
4. Add current index to back.
5. If window is full, print nums[deque[0]].