Counting Sort LeetCode Problems: All 8, With Python Solutions
Every problem in this library that LeetCode tags Counting Sort — 8 in total, 8 of them with a complete Python solution, a worked example and the time and space complexity of the approach.
- 8 problems
- 5 Easy
- 3 Medium
- 0 Hard
How Counting Sort problems are solved
A tag names the subject, not the method. These pattern hubs cover the techniques that actually solve Counting Sort problems — each one explains the approach, gives a Python template and states its complexity.
- Sorting — Spend O(n log n) once to buy an ordering that makes the rest of the problem trivial.
Counting Sort problems by difficulty
Problems with a complete Python solution are listed first, then by ascending problem number.
Easy (5)
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 561 | Array Partition | Easy | Greedy, Array, Counting Sort +1 |
| 1051 | Height Checker | Easy | Array, Counting Sort, Sorting |
| 1122 | Relative Sort Array | Easy | Array, Hash Table, Counting Sort +1 |
| 1365 | How Many Numbers Are Smaller Than the Current Number | Easy | Array, Hash Table, Counting Sort +1 |
| 2037 | Minimum Number of Moves to Seat Everyone | Easy | Greedy, Array, Counting Sort +1 |
Medium (3)
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 274 | H-Index | Medium | Array, Counting Sort, Sorting |
| 912 | Sort an Array | Medium | Array, Divide and Conquer, Bucket Sort +5 |
| 1833 | Maximum Ice Cream Bars | Medium | Greedy, Array, Counting Sort +1 |
Keep exploring
- Array1,569
- String672
- Hash Table588
- Math485
- Dynamic Programming481
- Sorting392
- Greedy346
- Depth-First Search289
- Binary Search253
- Database249
- Tree225
- Breadth-First Search223
- Matrix216
- Two Pointers201
- Bit Manipulation194
- Binary Tree174
- Heap (Priority Queue)163
- Prefix Sum157
- Stack157
- Simulation144
- Graph138
- Counting126
- Design122
- Sliding Window116
When the Counting Sort problem arrives live
Stealth Interview is a desktop app for macOS and Windows. It reads the coding problem off your screen, returns a working solution with a step-by-step explanation and its time and space complexity, and transcribes what the interviewer is saying — while staying invisible to screen sharing.