# Count Of Smaller Numbers After Self: Walkthrough
Count Of Smaller Numbers After Self shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Walk the array from right to left and query a Fenwick tree or sorted list for how many already-seen (so, to-the-right) values are smaller than nums[i], then insert nums[i]. Coordinate-compress first if values are large.
## 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(n log n).
## Common mistake
Scanning the suffix of the original array for each i, which is the O(n^2) solution the interviewer is trying to beat.
## 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.