| LRU Cache | Medium | 46.8% | 100.0% | Hash TableLinked ListDesign+1 |
| First Day Where You Have Been in All the Rooms | Medium | 40.4% | 87.5% | ArrayDynamic Programming |
| Remove Duplicate Letters | Medium | 52.8% | 87.5% | StringStackGreedy+1 |
| Smallest Subsequence of Distinct Characters | Medium | 63.1% | 87.5% | StringStackGreedy+1 |
| Combination Sum | Medium | 76.1% | 75.0% | ArrayBacktracking |
| House Robber | Medium | 52.9% | 75.0% | ArrayDynamic Programming |
| Number of Islands | Medium | 63.8% | 75.0% | ArrayDepth-First SearchBreadth-First Search+2 |
| Course Schedule | Medium | 50.8% | 75.0% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Maximal Square | Medium | 50.0% | 75.0% | ArrayDynamic ProgrammingMatrix |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 62.5% | Hash TableStringSliding Window |
| Trapping Rain Water | Hard | 66.8% | 62.5% | ArrayTwo PointersDynamic Programming+2 |
| Merge Intervals | Medium | 51.1% | 62.5% | ArraySorting |
| Basic Calculator II | Medium | 46.6% | 62.5% | MathStringStack |
| Two Sum | Easy | 57.1% | 62.5% | ArrayHash Table |
| Top K Frequent Elements | Medium | 65.8% | 62.5% | ArrayHash TableDivide and Conquer+5 |
| Regular Expression Matching | Hard | 30.4% | 62.5% | StringDynamic ProgrammingRecursion |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 62.5% | ArrayDynamic Programming |
| Design Memory Allocator | Medium | 49.7% | 62.5% | ArrayHash TableDesign+1 |
| Shortest Bridge | Medium | 59.3% | 62.5% | ArrayDepth-First SearchBreadth-First Search+1 |
| Multiply Strings | Medium | 43.5% | 62.5% | MathStringSimulation |
| Word Ladder | Hard | 44.9% | 62.5% | Hash TableStringBreadth-First Search |
| Search in Rotated Sorted Array | Medium | 44.1% | 50.0% | ArrayBinary Search |
| Longest Consecutive Sequence | Medium | 47.0% | 50.0% | ArrayHash TableUnion-Find |
| Sort List | Medium | 63.8% | 50.0% | Linked ListTwo PointersDivide and Conquer+2 |
| Reverse Linked List | Easy | 80.2% | 50.0% | Linked ListRecursion |
| House Robber II | Medium | 44.6% | 50.0% | ArrayDynamic Programming |
| Kth Largest Element in an Array | Medium | 68.8% | 50.0% | ArrayDivide and ConquerSorting+2 |
| Shortest Distance from All Buildings | Hard | 44.8% | 50.0% | |
| Decode String | Medium | 62.2% | 50.0% | StringStackRecursion |
| Number of Good Leaf Nodes Pairs | Medium | 71.8% | 50.0% | TreeDepth-First SearchBinary Tree |
| Climbing Stairs | Easy | 53.9% | 50.0% | MathDynamic ProgrammingMemoization |
| Insert Delete GetRandom O(1) | Medium | 55.3% | 50.0% | ArrayHash TableMath+2 |
| Combination Sum II | Medium | 59.0% | 50.0% | ArrayBacktracking |
| Minimum Area Rectangle | Medium | 55.3% | 50.0% | ArrayHash TableMath+2 |
| Rotting Oranges | Medium | 58.1% | 50.0% | ArrayBreadth-First SearchMatrix |
| Longest Common Subsequence | Medium | 58.9% | 50.0% | StringDynamic Programming |
| Search a 2D Matrix II | Medium | 56.8% | 50.0% | ArrayBinary SearchDivide and Conquer+1 |
| Trapping Rain Water II | Hard | 64.0% | 50.0% | ArrayBreadth-First SearchHeap (Priority Queue)+1 |
| Add Two Numbers | Medium | 47.9% | 50.0% | Linked ListMathRecursion |
| Basic Calculator | Hard | 46.5% | 50.0% | MathStringStack+1 |
| Subarray Sum Equals K | Medium | 46.8% | 50.0% | ArrayHash TablePrefix Sum |
| Subsets | Medium | 82.0% | 50.0% | ArrayBacktrackingBit Manipulation |
| Longest Repeating Character Replacement | Medium | 59.0% | 50.0% | Hash TableStringSliding Window |
| Remove Zero Sum Consecutive Nodes from Linked List | Medium | 53.1% | 50.0% | Hash TableLinked List |
| Remove K Digits | Medium | 36.4% | 50.0% | StringStackGreedy+1 |
| Maximum Profit in Job Scheduling | Hard | 54.6% | 50.0% | ArrayBinary SearchDynamic Programming+1 |
| Maximum Width of Binary Tree | Medium | 45.2% | 50.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Clone Graph | Medium | 64.7% | 50.0% | Hash TableDepth-First SearchBreadth-First Search+1 |
| Reverse Linked List II | Medium | 51.0% | 50.0% | Linked List |
| Longest Palindromic Substring | Medium | 37.3% | 50.0% | Two PointersStringDynamic Programming |
| Minimum Swaps to Group All 1's Together II | Medium | 65.6% | 50.0% | ArraySliding Window |
| Find Peak Element | Medium | 46.8% | 50.0% | ArrayBinary Search |
| Valid Parentheses | Easy | 43.7% | 50.0% | StringStack |
| Find the Length of the Longest Common Prefix | Medium | 57.0% | 50.0% | ArrayHash TableString+1 |
| Intersection of Two Linked Lists | Easy | 63.2% | 50.0% | Hash TableLinked ListTwo Pointers |
| Maximum Subarray | Medium | 53.0% | 50.0% | ArrayDivide and ConquerDynamic Programming |
| Product of the Last K Numbers | Medium | 62.9% | 50.0% | ArrayMathDesign+2 |
| Jump Game | Medium | 40.5% | 50.0% | ArrayDynamic ProgrammingGreedy |
| Accounts Merge | Medium | 60.9% | 50.0% | ArrayHash TableString+4 |
| Merge k Sorted Lists | Hard | 58.8% | 50.0% | Linked ListDivide and ConquerHeap (Priority Queue)+1 |
| Open the Lock | Medium | 61.1% | 50.0% | ArrayHash TableString+1 |
| Text Justification | Hard | 50.4% | 50.0% | ArrayStringSimulation |
| Delete Node in a BST | Medium | 54.2% | 50.0% | TreeBinary Search TreeBinary Tree |
| Restore IP Addresses | Medium | 55.3% | 50.0% | StringBacktracking |