# Numbers With Same Consecutive Differences: Study Guide
Numbers With Same Consecutive Differences shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
BFS or DFS from digits 1-9, appending prev+k and prev-k at each step (stay inside 0-9). Collect all n-digit numbers built this way. When k=0 do not enqueue the same child twice.
## 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(2^n).
## Common mistake
Starting from 0 when n>1, or double-appending when k=0.
## 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 interview copilot.