# Jump Game VII: Practice Notes

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

## Key idea

BFS or a sliding window of reachable indices; you may jump to i+j for j in [minJump, maxJump] if s[i]=='0'.

## 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/DFS, union-find, topological sort, or tree 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

A DP that rescans the whole jump range at every index.

## 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 assistant for technical interviews.