# Monotonic Queue For Sliding Window Maximum: Interview Notes
Monotonic Queue For Sliding Window Maximum shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Keep indices with decreasing values; pop the back while smaller, pop the front when it leaves the window.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n).
## Common mistake
Storing values instead of indices, so you cannot tell when the front expired.
## 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 this tool.