# Numbers At Most N Given Digit Set: Interview Notes
Numbers At Most N Given Digit Set shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Count all shorter numbers as sum of d^len, then walk N's digits counting smaller choices and continue only if the exact digit is in the set.
## 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(log N).
## Common mistake
Brute-force generating numbers, or forgetting the equal-to-N case.
## 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 Linkjob AI interview assistant.