# LeetCode 4370: Sort Integers by Number of Bits

## Problem sketch
Return the required answer for the titled problem under typical interview constraints.

## Approach
Linear scan with hash maps / counters as needed. Prefer O(n) time.

## Interview tip
Keep a short checklist when practicing: restate, examples, complexity, code, dry-run. For live rounds I keep [the Linkjob AI app](https://www.linkjob.ai/) nearby as a quiet real-time copilot.

## Pseudocode
```
def solve(data):
    # aggregates
    return answer
```