2324 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 2442. Count Number of Distinct Integers After Reverse Operations | Medium | 19.7% | TopicsArrayHash TableMathCounting |
| 2446. Determine if Two Events Have Conflict | Easy | 19.7% | TopicsArrayString |
| 2842. Count K-Subsequences of a String With Maximum Beauty | Hard | 19.7% | TopicsHash TableMathStringGreedySortingCombinatoricsFermat's Little Theorem |
| 2924. Find Champion II | Medium | 19.7% | TopicsGraph Theory |
| 3007. Maximum Number That Sum of the Prices Is Less Than or Equal to K | Medium | 19.7% | TopicsMathBinary SearchDynamic ProgrammingBit Manipulation |
| 3027. Find the Number of Ways to Place People II | Hard | 19.7% | TopicsArrayMathGeometrySortingEnumeration |
| Unique Binary Search Trees | Medium | 19.7% | TopicsMathDynamic ProgrammingTreeBinary Search TreeBinary Tree |
| 2104. Sum of Subarray Ranges | Medium | 19.7% | TopicsArrayStackMonotonic Stack |
| Rectangle Area | Medium | 19.7% | TopicsMathGeometry |
| Meeting Rooms | Easy | 19.7% | TopicsArraySortingQuicksort |
| 298. Binary Tree Longest Consecutive Sequence | Medium | 19.7% | TopicsTreeDepth-First SearchBinary TreeDP on Trees |
| 2264. Largest 3-Same-Digit Number in String | Easy | 19.7% | TopicsString |
| Integer Break | Medium | 19.7% | TopicsMathDynamic Programming |
| 365. Water and Jug Problem | Medium | 19.7% | TopicsMathDepth-First SearchBreadth-First SearchBézout's LemmaEuclidean AlgorithmGreatest Common DivisorExtended Euclidean Algorithm |
| Longest Substring with At Least K Repeating Characters | Medium | 19.7% | TopicsHash TableStringDivide and ConquerSliding Window |
| 441. Arranging Coins | Easy | 19.7% | TopicsMathBinary Search |
| Number of Boomerangs | Medium | 19.7% | TopicsArrayHash TableMath |
| Longest Uncommon Subsequence II | Medium | 19.7% | TopicsArrayHash TableTwo PointersStringSorting |
| Erect the Fence | Hard | 19.7% | TopicsArrayMathGeometryConvex HullPolygons |
| Not Boring Movies | Easy | 19.7% | TopicsDatabase |
| 659. Split Array into Consecutive Subsequences | Medium | 19.7% | TopicsArrayHash TableGreedyHeap (Priority Queue) |
| 2616. Minimize the Maximum Difference of Pairs | Medium | 19.7% | TopicsArrayBinary SearchDynamic ProgrammingGreedySorting |
| Next Closest Time | Medium | 19.7% | TopicsHash TableStringBacktrackingEnumeration |
| 780. Reaching Points | Hard | 19.7% | TopicsMathEuclidean AlgorithmGreatest Common Divisor |
| 879. Profitable Schemes | Hard | 19.7% | TopicsArrayDynamic ProgrammingKnapsack Problem0-1 Knapsack |
