# Count Symmetric Integers: Walkthrough
Count Symmetric Integers shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
A number is symmetric when it has an even number of digits and the two halves have equal digit sums. Scan [low, high].
## 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((high-low) log high).
## Common mistake
Splitting an odd-length number or comparing products instead of sums.
## 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.