# Count Special Integers: Walkthrough

Count Special Integers shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Digit DP counting integers in [1, n] whose digits are all unique. State is (pos, used-mask, tight, started). The started flag skips leading zeros so they do not burn bits of the mask.

## 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 * 2^10 * 10).

## Common mistake

Forgetting the leading-zero flag and marking 0 as used on prefixes.

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