# Stepping Numbers: Interview Notes
Stepping Numbers shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
A stepping number has adjacent digits differing by 1. Find all of them in [low, high]. BFS from 1..9 (and 0 if in range): append last-digit±1 when in 0..9. Each generated number is checked against the bounds.
## 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(#stepping numbers).
## Common mistake
Testing every integer in [low, high] by digit walks when the range is huge.
## 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 undetectable AI interview copilot.