# Sliding Window Maximum: Walkthrough
Sliding Window Maximum shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Keep a decreasing deque of indices: the front is the max of the current window, and pop from the back anything smaller than the incoming value.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (two pointers, a sliding window, prefix sums, a monotonic stack, or binary search on the answer) and why a linear nested scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n).
## Common mistake
Scanning each window in O(k), which is O(nk) and too slow.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at the Linkjob AI app.