# Radix Heap Monotone Dijkstra: Study Guide
Radix Heap Monotone Dijkstra shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
When keys only increase (as in Dijkstra with nonnegative weights), bucket nodes by the high bits of the distance difference from the last extracted minimum.
## 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(m + n B) or O(m + n log C) depending on the radix, for monotone integer keys.
## Common mistake
Inserting a node into a bucket whose range does not contain its current distance, which can extract vertices out of order.
## 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.