# How Many Numbers Are Smaller Than The Current Number: Study Guide

How Many Numbers Are Smaller Than The Current Number shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

For each nums[i], count how many values are strictly smaller. Count-sort (values are 0..100) into a prefix, or sort a copy and binary-search the insertion point.

## 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 + U) or O(n log n).

## Common mistake

Using a nested loop when n=2 e4 without mentioning the cost, or counting values <= nums[i] (not strictly smaller).

## 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 interview copilot app.