171 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 647. Palindromic Substrings | Medium | 47.3% | TopicsTwo PointersStringDynamic Programming |
| Accounts Merge | Medium | 47.3% | TopicsArrayHash TableStringDepth-First SearchBreadth-First SearchUnion-FindSorting |
| Intersection of Two Linked Lists | Easy | 47.3% | TopicsHash TableLinked ListTwo Pointers |
| 61. Rotate List | Medium | 45.1% | TopicsLinked ListTwo Pointers |
| Two Sum III - Data structure design | Easy | 45.1% | TopicsArrayHash TableTwo PointersDesignData Stream |
| Binary Search Tree Iterator | Medium | 45.1% | TopicsStackTreeDesignBinary Search TreeBinary TreeIterator |
| 2196. Create Binary Tree From Descriptions | Medium | 45.1% | TopicsArrayHash TableTreeBinary Tree |
| 2344. Minimum Deletions to Make Array Divisible | Hard | 45.1% | TopicsArrayMathSortingHeap (Priority Queue)Number TheoryEuclidean AlgorithmGreatest Common Divisor |
| 2472. Maximum Number of Non-overlapping Palindrome Substrings | Hard | 45.1% | TopicsTwo PointersStringDynamic ProgrammingGreedy |
| Find Largest Value in Each Tree Row | Medium | 45.1% | TopicsTreeDepth-First SearchBreadth-First SearchBinary Tree |
| Maximize Total Tastiness of Purchased Fruits | Medium | 45.1% | TopicsArrayDynamic Programming |
| 2532. Time to Cross a Bridge | Hard | 45.1% | TopicsArrayHeap (Priority Queue)Simulation |
| 633. Sum of Square Numbers | Medium | 45.1% | TopicsMathTwo PointersBinary Search |
| Count Different Palindromic Subsequences | Hard | 45.1% | TopicsStringDynamic Programming |
| 946. Validate Stack Sequences | Medium | 45.1% | TopicsArrayStackSimulation |
| Building H2O | Medium | 45.1% | TopicsConcurrency |
| New Users Daily Count | Medium | 45.1% | TopicsDatabase |
| User Purchase Platform | Hard | 45.1% | TopicsDatabase |
| Article Views I | Easy | 45.1% | TopicsDatabase |
| Article Views II | Medium | 45.1% | TopicsDatabase |
| 1343. Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold | Medium | 45.1% | TopicsArraySliding Window |
| 1588. Sum of All Odd Length Subarrays | Easy | 45.1% | TopicsArrayMathPrefix Sum |
| 3850. Count Sequences to K | Hard | 45.1% | TopicsArrayMathDynamic ProgrammingMemoizationNumber Theory |
| 3891. Minimum Increase to Maximize Special Indices | Medium | 45.1% | TopicsArrayDynamic ProgrammingGreedyPrefix Sum |
| 261. Graph Valid Tree | Medium | 42.6% | TopicsDepth-First SearchBreadth-First SearchUnion-FindGraph Theory |
