Sliding Window Maximum / visualized

The max of every length-k window, in O(n). A monotonic deque holds candidate indices with values in decreasing order — so the front is always the current window's max. Each element is pushed and popped at most once, which is what beats the naïve O(n·k).