# Jump Game IV: Walkthrough
Jump Game IV shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
BFS from index 0: from i you may go to i-1, i+1, or any other index with the same value. Use a map from value to indices and clear that list after first use so each value-group is expanded once.
## 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
DFS that revisits the same-value list over and over (exponential) or forgetting to delete the list after using it.
## 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 real-time AI interview assistant for live interviews.