2324 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 1020. Number of Enclaves | Medium | 26.5% | TopicsArrayDepth-First SearchBreadth-First SearchUnion-FindMatrix |
| Immediate Food Delivery II | Medium | 26.5% | TopicsDatabase |
| 1376. Time Needed to Inform All Employees | Medium | 26.5% | TopicsTreeDepth-First SearchBreadth-First Search |
| 1547. Minimum Cost to Cut a Stick | Hard | 26.5% | TopicsArrayDynamic ProgrammingSorting |
| K-th Smallest in Lexicographical Order | Hard | 26.5% | TopicsTrie |
| 3404. Count Special Subsequences | Medium | 26.5% | TopicsArrayHash TableMathEnumeration |
| 3394. Check if Grid can be Cut into Sections | Medium | 26.5% | TopicsArraySorting |
| 3397. Maximum Number of Distinct Elements After Operations | Medium | 26.5% | TopicsArrayGreedySorting |
| Longest Harmonious Subsequence | Easy | 26.5% | TopicsArrayHash TableSliding WindowSortingCounting |
| 286. Walls and Gates | Medium | 25.6% | TopicsArrayBreadth-First SearchMatrix |
| Shortest Distance from All Buildings | Hard | 25.6% | TopicsArrayBreadth-First SearchMatrix |
| 342. Power of Four | Easy | 25.6% | TopicsMathBit ManipulationRecursion |
| Kth Smallest Element in a Sorted Matrix | Medium | 25.6% | TopicsArrayBinary SearchSortingHeap (Priority Queue)Matrix |
| 465. Optimal Account Balancing | Hard | 25.6% | TopicsArrayDynamic ProgrammingBacktrackingBit ManipulationBitmask |
| 501. Find Mode in Binary Search Tree | Easy | 25.6% | TopicsTreeDepth-First SearchBinary Search TreeBinary Tree |
| Student Attendance Record II | Hard | 25.6% | TopicsDynamic Programming |
| Delete Operation for Two Strings | Medium | 25.6% | TopicsStringDynamic ProgrammingLongest Common Subsequence |
| Maximum Sum of 3 Non-Overlapping Subarrays | Hard | 25.6% | TopicsArrayDynamic ProgrammingSliding WindowPrefix Sum |
| 747. Largest Number At Least Twice of Others | Easy | 25.6% | TopicsArraySorting |
| 809. Expressive Words | Medium | 25.6% | TopicsArrayTwo PointersString |
| 845. Longest Mountain in Array | Medium | 25.6% | TopicsArrayTwo PointersDynamic ProgrammingEnumeration |
| 889. Construct Binary Tree from Preorder and Postorder Traversal | Medium | 25.6% | TopicsArrayHash TableDivide and ConquerTreeBinary Tree |
| 935. Knight Dialer | Medium | 25.6% | TopicsDynamic Programming |
| 1007. Minimum Domino Rotations For Equal Row | Medium | 25.6% | TopicsArrayGreedy |
| 1726. Tuple with Same Product | Medium | 25.6% | TopicsArrayHash TableCounting |
