# Sort Integers By The Number Of 1 Bits: Interview Notes

Sort Integers By The Number Of 1 Bits shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Sort by popcount ascending, then by value ascending. Brian Kernighan or a builtin bit_count is fine.

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

Using the numeric value as the only key.

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