# Count Beautiful Numbers: Study Guide
Count Beautiful Numbers shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Digit DP over [low, high] where a number is beautiful if it is divisible by the sum of its digits (or the prompt's beauty rule). Track (pos, tight, started, digit_sum, value_mod) and subtract the count below low.
## 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(digits * sum * mod).
## Common mistake
Enumerating the range, or not resetting sum/mod on leading zeros.
## 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 coding interview assistant.