# Jump Game V: Study Guide
Jump Game V shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
From i you may jump to a lower index j in (i-d, i) or (i, i+d) whose value is strictly less than arr[i], and you cannot pass a >= arr[i] bar. Memoized DFS: dp[i] = 1 + max dp[j] over legal jumps (or 1 if none).
## 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 d).
## Common mistake
Allowing a jump over a taller bar, or treating it as Jump Game I/II without the “strictly lower destination” rule.
## 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 job interview answers in real time.