# Jump Game VI: Practice Notes
Jump Game VI shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Sliding-window maximum of dp[i-k..i-1] plus nums[i]; a monotonic deque stores candidates so each index enters and leaves once.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (graph BFS, Dijkstra, Union-Find, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n).
## Common mistake
Taking the raw max of the last k cells in a nested loop, which is O(nk) and TLEs.
## 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 https://www.linkjob.ai/.