2324 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 2481. Minimum Cuts to Divide a Circle | Easy | 8.2% | TopicsMathGeometry |
| Tenth Line | Easy | 8.2% | TopicsShell |
| 2573. Find the String with LCP | Hard | 8.2% | TopicsArrayStringDynamic ProgrammingGreedyUnion-FindMatrix |
| 848. Shifting Letters | Medium | 8.2% | TopicsArrayStringPrefix Sum |
| 3272. Find the Count of Good Integers | Hard | 8.2% | TopicsHash TableMathCombinatoricsEnumeration |
| 2179. Count Good Triplets in an Array | Hard | 8.2% | TopicsArrayBinary SearchDivide and ConquerBinary Indexed TreeSegment TreeMerge SortOrdered Set |
| Patients With a Condition | Easy | 8.2% | TopicsDatabase |
| 3523. Make Array Non-decreasing | Medium | 8.2% | TopicsArrayStackGreedyMonotonic Stack |
| 2145. Count the Hidden Sequences | Medium | 8.2% | TopicsArrayPrefix Sum |
| 797. All Paths From Source to Target | Medium | 8.2% | TopicsBacktrackingDepth-First SearchBreadth-First SearchGraph TheoryDirected Acyclic Graph |
| The Latest Login in 2020 | Easy | 8.2% | TopicsDatabase |
| 984. String Without AAA or BBB | Medium | 8.2% | TopicsStringGreedy |
| 3373. Maximize the Number of Target Nodes After Connecting Trees II | Hard | 8.2% | TopicsTreeDepth-First SearchBreadth-First Search |
| 1563. Stone Game V | Hard | 8.2% | TopicsArrayMathDynamic ProgrammingGame Theory |
| 1061. Lexicographically Smallest Equivalent String | Medium | 8.2% | TopicsStringUnion-Find |
| 3442. Maximum Difference Between Even and Odd Frequency I | Easy | 8.2% | TopicsHash TableStringCounting |
| 3423. Maximum Difference Between Adjacent Elements in a Circular Array | Easy | 8.2% | TopicsArray |
| 1432. Max Difference You Can Get From Changing an Integer | Medium | 8.2% | TopicsMathGreedy |
| 3585. Find Weighted Median Node in Tree | Hard | 8.2% | TopicsArrayBinary SearchDynamic ProgrammingBit ManipulationTreeDepth-First Search |
| 996. Number of Squareful Arrays | Hard | 8.2% | TopicsArrayHash TableMathDynamic ProgrammingBacktrackingBit ManipulationBitmask |
| 1755. Closest Subsequence Sum | Hard | 8.2% | TopicsArrayTwo PointersDynamic ProgrammingBit ManipulationMeet in the MiddleSortingBitmask |
| Validate IP Address | Medium | 8.2% | TopicsString |
| 3307. Find the K-th Character in String Game II | Hard | 8.2% | TopicsMathBit ManipulationRecursion |
| 1865. Finding Pairs With a Certain Sum | Medium | 8.2% | TopicsArrayHash TableDesign |
| 3630. Partition Array for Maximum XOR and AND | Hard | 8.2% | TopicsArrayMathGreedyBit ManipulationEnumeration |
