# Odd Even Jump: Study Guide
Odd Even Jump shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
From i you may odd-jump to the smallest value >= nums[i] to the right, or even-jump to the largest value <= nums[i]. Process right-to-left with an ordered map of value -> index and boolean DP[i][odd/even].
## 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 log n).
## Common mistake
Always jumping to the nearest index instead of the value-based next jump the problem defines.
## 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 best AI tool for coding tests and OAs.