# Lexicographical Numbers: Practice Notes

Lexicographical Numbers shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Return 1..n in lex order (1,10,11,...,2,20,...). DFS: from cur try children cur*10+d, or iteratively jump to the next prefix (go deeper by *10 while possible, else increment and strip trailing nines).

## 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).

## Common mistake

Converting every integer to a string and sorting (O(n log n) extra memory and a common follow-up ban) or missing the wrap from 19 to 2.

## 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 helper that uses your resume.