# Jump Game VI: Interview Notes

Jump Game VI shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Max score to reach n-1 with jumps of size at most k. DP[i] = nums[i] + max(DP[i-k..i-1]). Maintain that sliding-window maximum with a monotonic decreasing deque of indices.

## 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

A nested scan of the last k cells at every i (O(n k)), which TLEs, or allowing jumps longer than k.

## 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 AI interview assistant.