2324 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 1005. Maximize Sum Of Array After K Negations | Easy | 5% | TopicsArrayGreedySorting |
| Longest Repeating Substring | Medium | 5% | TopicsStringBinary SearchDynamic ProgrammingRolling HashSuffix ArrayHash FunctionSuffix AutomatonSuffix Tree |
| 1759. Count Number of Homogenous Substrings | Medium | 5% | TopicsMathString |
| 2239. Find Closest Number to Zero | Easy | 5% | TopicsArray |
| 2316. Count Unreachable Pairs of Nodes in an Undirected Graph | Medium | 5% | TopicsDepth-First SearchBreadth-First SearchUnion-FindGraph Theory |
| 2448. Minimum Cost to Make Array Equal | Hard | 5% | TopicsArrayBinary SearchGreedySortingPrefix Sum |
| 2610. Convert an Array Into a 2D Array With Conditions | Medium | 5% | TopicsArrayHash Table |
| 2645. Minimum Additions to Make Valid String | Medium | 5% | TopicsStringDynamic ProgrammingStackGreedy |
| 2367. Number of Arithmetic Triplets | Easy | 5% | TopicsArrayHash TableTwo PointersEnumeration |
| 2405. Optimal Partition of String | Medium | 5% | TopicsHash TableStringGreedy |
| Arithmetic Slices II - Subsequence | Hard | 5% | TopicsArrayDynamic Programming |
| Poor Pigs | Hard | 5% | TopicsMathDynamic ProgrammingCombinatorics |
| 2486. Append Characters to String to Make Subsequence | Medium | 5% | TopicsTwo PointersStringGreedy |
| Replace Words | Medium | 5% | TopicsArrayHash TableStringTrie |
| Differences Between Two Objects | Medium | 5% | Topics— |
| 861. Score After Flipping Matrix | Medium | 5% | TopicsArrayGreedyBit ManipulationMatrix |
| 1171. Remove Zero Sum Consecutive Nodes from Linked List | Medium | 5% | TopicsHash TableLinked List |
| 1361. Validate Binary Tree Nodes | Medium | 5% | TopicsTreeDepth-First SearchBreadth-First SearchUnion-FindGraph TheoryBinary Tree |
| 3193. Count the Number of Inversions | Hard | 5% | TopicsArrayDynamic Programming |
| 1497. Check If Array Pairs Are Divisible by k | Medium | 5% | TopicsArrayHash TableCounting |
| 1579. Remove Max Number of Edges to Keep Graph Fully Traversable | Hard | 5% | TopicsUnion-FindGraph Theory |
| 1395. Count Number of Teams | Medium | 5% | TopicsArrayDynamic ProgrammingBinary Indexed TreeSegment Tree |
| Design Circular Deque | Medium | 5% | TopicsArrayLinked ListDesignQueue |
| 1420. Build Array Where You Can Find The Maximum Exactly K Comparisons | Hard | 5% | TopicsDynamic ProgrammingPrefix Sum |
| 2134. Minimum Swaps to Group All 1's Together II | Medium | 5% | TopicsArraySliding Window |
