2324 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 1593. Split a String Into the Max Number of Unique Substrings | Medium | 22.3% | TopicsHash TableStringBacktracking |
| 1608. Special Array With X Elements Greater Than or Equal X | Easy | 22.3% | TopicsArrayBinary SearchSorting |
| 1630. Arithmetic Subarrays | Medium | 22.3% | TopicsArrayHash TableSorting |
| 1697. Checking Existence of Edge Length Limited Paths | Hard | 22.3% | TopicsArrayTwo PointersUnion-FindGraph TheorySorting |
| 1707. Maximum XOR With an Element From Array | Hard | 22.3% | TopicsArrayBit ManipulationTrie |
| 2011. Final Value of Variable After Performing Operations | Easy | 22.3% | TopicsArrayStringSimulation |
| 2018. Check if Word Can Be Placed In Crossword | Medium | 22.3% | TopicsArrayMatrixEnumeration |
| 2050. Parallel Courses III | Hard | 22.3% | TopicsArrayDynamic ProgrammingGraph TheoryTopological SortDirected Acyclic Graph |
| 2114. Maximum Number of Words Found in Sentences | Easy | 22.3% | TopicsArrayString |
| 2150. Find All Lonely Numbers in the Array | Medium | 22.3% | TopicsArrayHash TableCounting |
| 2185. Counting Words With a Given Prefix | Easy | 22.3% | TopicsArrayStringString Matching |
| 2348. Number of Zero-Filled Subarrays | Medium | 22.3% | TopicsArrayMath |
| 2392. Build a Matrix With Conditions | Hard | 22.3% | TopicsArrayGraph TheoryTopological SortMatrixDirected Acyclic Graph |
| Check if There is a Path With Equal Number of 0's And 1's | Medium | 22.3% | TopicsArrayDynamic ProgrammingMatrix |
| 2570. Merge Two 2D Arrays by Summing Values | Easy | 22.3% | TopicsArrayHash TableTwo Pointers |
| 93. Restore IP Addresses | Medium | 22.3% | TopicsStringBacktracking |
| Unique Binary Search Trees II | Medium | 22.3% | TopicsDynamic ProgrammingBacktrackingTreeBinary Search TreeBinary Tree |
| 211. Design Add and Search Words Data Structure | Medium | 22.3% | TopicsStringDepth-First SearchDesignTrie |
| Range Sum Query 2D - Mutable | Medium | 22.3% | TopicsArrayDesignBinary Indexed TreeSegment TreeMatrixSqrt Decomposition |
| Maximum Product of Word Lengths | Medium | 22.3% | TopicsArrayStringBit Manipulation |
| 2290. Minimum Obstacle Removal to Reach Corner | Hard | 22.3% | TopicsArrayBreadth-First SearchGraph TheoryHeap (Priority Queue)MatrixShortest Path0-1 BFSDijkstra's Algorithm |
| Palindrome Pairs | Hard | 22.3% | TopicsArrayHash TableStringTrieHash Function |
| 765. Couples Holding Hands | Hard | 22.3% | TopicsGreedyDepth-First SearchBreadth-First SearchUnion-FindGraph Theory |
| 934. Shortest Bridge | Medium | 22.3% | TopicsArrayDepth-First SearchBreadth-First SearchMatrix |
| 988. Smallest String Starting From Leaf | Medium | 22.3% | TopicsStringBacktrackingTreeDepth-First SearchBinary Tree |
