| LRU Cache | Medium | 46.8% | 100.0% | Hash TableLinked ListDesign+1 |
| Find the Longest Equal Subarray | Medium | 37.6% | 93.4% | ArrayHash TableBinary Search+1 |
| Logger Rate Limiter | Easy | 76.8% | 80.9% | Hash TableDesignData Stream |
| String Compression | Medium | 59.6% | 77.4% | Two PointersString |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 73.2% | Hash TableStringSliding Window |
| Add Two Numbers | Medium | 48.0% | 68.0% | Linked ListMathRecursion |
| Design HashMap | Easy | 66.4% | 68.0% | ArrayHash TableLinked List+2 |
| Search in Rotated Sorted Array | Medium | 44.1% | 68.0% | ArrayBinary Search |
| Group Anagrams | Medium | 72.2% | 68.0% | ArrayHash TableString+1 |
| Decode String | Medium | 62.3% | 68.0% | StringStackRecursion |
| Minimum Number of Food Buckets to Feed the Hamsters | Medium | 48.0% | 68.0% | StringDynamic ProgrammingGreedy |
| Min Stack | Medium | 57.7% | 68.0% | StackDesign |
| Binary Tree Level Order Traversal | Medium | 72.2% | 68.0% | TreeBreadth-First SearchBinary Tree |
| Merge Intervals | Medium | 51.2% | 61.4% | ArraySorting |
| Merge Sorted Array | Easy | 54.4% | 61.4% | ArrayTwo PointersSorting |
| Median of Two Sorted Arrays | Hard | 46.0% | 61.4% | ArrayBinary SearchDivide and Conquer |
| Insert Delete GetRandom O(1) | Medium | 55.3% | 61.4% | ArrayHash TableMath+2 |
| Restore IP Addresses | Medium | 55.3% | 61.4% | StringBacktracking |
| Top K Frequent Words | Medium | 60.0% | 61.4% | ArrayHash TableString+5 |
| Integer to Roman | Medium | 70.5% | 61.4% | Hash TableMathString |
| Longest Common Prefix | Easy | 47.1% | 61.4% | ArrayStringTrie |
| Subarray Sum Equals K | Medium | 46.8% | 61.4% | ArrayHash TablePrefix Sum |
| Linked List Cycle | Easy | 53.9% | 61.4% | Hash TableLinked ListTwo Pointers |
| Design Twitter | Medium | 44.2% | 52.1% | Hash TableLinked ListDesign+1 |
| Maximum Profit in Job Scheduling | Hard | 54.6% | 52.1% | ArrayBinary SearchDynamic Programming+1 |
| Diameter of Binary Tree | Easy | 65.1% | 52.1% | TreeDepth-First SearchBinary Tree |
| Two Sum | Easy | 57.1% | 52.1% | ArrayHash Table |
| Merge Two Sorted Lists | Easy | 68.0% | 52.1% | Linked ListRecursion |
| Sliding Window Maximum | Hard | 48.5% | 52.1% | ArrayQueueSliding Window+2 |
| Basic Calculator | Hard | 46.6% | 52.1% | MathStringStack+1 |
| Invert Binary Tree | Easy | 79.8% | 52.1% | TreeDepth-First SearchBreadth-First Search+1 |
| Word Break | Medium | 49.1% | 52.1% | ArrayHash TableString+3 |
| Meeting Rooms | Easy | 59.3% | 52.1% | ArraySorting |
| Path Sum | Easy | 54.5% | 52.1% | TreeDepth-First SearchBreadth-First Search+1 |
| Path Sum II | Medium | 61.8% | 52.1% | BacktrackingTreeDepth-First Search+1 |
| Valid Parentheses | Easy | 43.7% | 52.1% | StringStack |
| Basic Calculator II | Medium | 46.7% | 52.1% | MathStringStack |
| Multiply Strings | Medium | 43.6% | 52.1% | MathStringSimulation |
| Advantage Shuffle | Medium | 54.3% | 52.1% | ArrayTwo PointersGreedy+1 |
| Reconstruct Itinerary | Hard | 44.3% | 52.1% | ArrayStringDepth-First Search+4 |
| Reverse Linked List II | Medium | 51.0% | 52.1% | Linked List |
| Koko Eating Bananas | Medium | 49.7% | 52.1% | ArrayBinary Search |
| Maximum Length of a Concatenated String with Unique Characters | Medium | 54.6% | 52.1% | ArrayStringBacktracking+1 |
| Longest Palindromic Substring | Medium | 37.4% | 52.1% | Two PointersStringDynamic Programming |
| Binary Tree Zigzag Level Order Traversal | Medium | 63.2% | 52.1% | TreeBreadth-First SearchBinary Tree |
| Remove Zero Sum Consecutive Nodes from Linked List | Medium | 53.1% | 52.1% | Hash TableLinked List |