# Strobogrammatic Number II: Explained
Strobogrammatic Number II shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Generate all n-digit strobogrammatic numbers. Recurse from the outside in, placing valid pairs (and 0/1/8 in the middle when n is odd). Do not put a leading zero unless n is 1.
## 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(5^{n/2}).
## Common mistake
Allowing a leading zero on n > 1.
## 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.