2324 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 532. K-diff Pairs in an Array | Medium | 16.6% | TopicsArrayHash TableTwo PointersBinary SearchSorting |
| 740. Delete and Earn | Medium | 16.6% | TopicsArrayHash TableDynamic Programming |
| Counter II | Easy | 16.6% | Topics— |
| Serialize and Deserialize N-ary Tree | Hard | 16.6% | TopicsStringTreeDepth-First SearchBreadth-First Search |
| 706. Design HashMap | Easy | 16.6% | TopicsArrayHash TableLinked ListDesignHash Function |
| Last Person to Fit in the Bus | Medium | 16.6% | TopicsDatabase |
| 1237. Find Positive Integer Solution for a Given Equation | Medium | 16.6% | TopicsMathTwo PointersBinary SearchInteractive |
| 3196. Maximize Total Cost of Alternating Subarrays | Medium | 16.6% | TopicsArrayDynamic Programming |
| 1377. Frog Position After T Seconds | Hard | 16.6% | TopicsTreeDepth-First SearchBreadth-First SearchGraph Theory |
| 1605. Find Valid Matrix Given Row and Column Sums | Medium | 16.6% | TopicsArrayGreedyMatrixFlow Network |
| 1636. Sort Array by Increasing Frequency | Easy | 16.6% | TopicsArrayHash TableSorting |
| Fix Names in a Table | Easy | 16.6% | TopicsDatabase |
| 1844. Replace All Digits with Characters | Easy | 16.6% | TopicsString |
| 1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance | Medium | 16.6% | TopicsDynamic ProgrammingGraph TheoryShortest PathDijkstra's AlgorithmBellman–Ford AlgorithmFloyd–Warshall Algorithm |
| 3234. Count the Number of Substrings With Dominant Ones | Medium | 16.6% | TopicsStringEnumeration |
| The Number of Employees Which Report to Each Employee | Easy | 16.6% | TopicsDatabase |
| 1653. Minimum Deletions to Make String Balanced | Medium | 16.6% | TopicsStringDynamic ProgrammingStack |
| Find Followers Count | Easy | 16.6% | TopicsDatabase |
| Smallest Range Covering Elements from K Lists | Hard | 16.6% | TopicsArrayHash TableGreedySliding WindowSortingHeap (Priority Queue) |
| 1545. Find Kth Bit in Nth Binary String | Medium | 16.6% | TopicsStringRecursionSimulation |
| 2127. Maximum Employees to Be Invited to a Meeting | Hard | 16.6% | TopicsArrayDynamic ProgrammingDepth-First SearchGraph TheoryTopological SortKosaraju's AlgorithmTarjan's SCC Algorithm |
| 3341. Find Minimum Time to Reach Last Room I | Medium | 16.6% | TopicsArrayGraph TheoryHeap (Priority Queue)MatrixShortest Path |
| 1861. Rotating the Box | Medium | 16.6% | TopicsArrayTwo PointersMatrix |
| 821. Shortest Distance to a Character | Easy | 16.6% | TopicsArrayTwo PointersString |
| 1413. Minimum Value to Get Positive Step by Step Sum | Easy | 16.6% | TopicsArrayPrefix Sum |
