| Word Break | Medium | 49.1% | 100.0% | ArrayHash TableString+3 |
| Subsets | Medium | 82.1% | 100.0% | ArrayBacktrackingBit Manipulation |
| Decode String | Medium | 62.3% | 98.0% | StringStackRecursion |
| LFU Cache | Hard | 48.6% | 95.8% | Hash TableLinked ListDesign+1 |
| Longest Substring with At Most K Distinct Characters | Medium | 49.9% | 95.8% | Hash TableStringSliding Window |
| LRU Cache | Medium | 46.8% | 93.4% | Hash TableLinked ListDesign+1 |
| Split BST | Medium | 82.2% | 93.4% | TreeBinary Search TreeRecursion+1 |
| Range Module | Hard | 44.7% | 93.4% | DesignSegment TreeOrdered Set |
| Find Pivot Index | Easy | 62.1% | 93.4% | ArrayPrefix Sum |
| Course Schedule | Medium | 50.8% | 90.7% | Depth-First SearchBreadth-First SearchGraph+1 |
| Design In-Memory File System | Hard | 48.4% | 90.7% | Hash TableStringDesign+2 |
| Unique Paths II | Medium | 44.2% | 80.5% | ArrayDynamic ProgrammingMatrix |
| Design Twitter | Medium | 44.2% | 80.5% | Hash TableLinked ListDesign+1 |
| Shopping Offers | Medium | 52.3% | 75.9% | ArrayDynamic ProgrammingBacktracking+3 |
| Longest Repeating Substring | Medium | 63.4% | 75.9% | StringBinary SearchDynamic Programming+3 |
| Unique Paths | Medium | 66.6% | 75.9% | MathDynamic ProgrammingCombinatorics |
| Possible Bipartition | Medium | 52.4% | 75.9% | Depth-First SearchBreadth-First SearchUnion Find+1 |
| Regular Expression Matching | Hard | 30.5% | 75.9% | StringDynamic ProgrammingRecursion |
| Shortest Bridge | Medium | 59.3% | 70.2% | ArrayDepth-First SearchBreadth-First Search+1 |
| Remove K Digits | Medium | 36.4% | 70.2% | StringStackGreedy+1 |
| Find K Closest Elements | Medium | 49.4% | 70.2% | ArrayTwo PointersBinary Search+3 |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 70.2% | Hash TableStringSliding Window |
| Longest Duplicate Substring | Hard | 31.1% | 70.2% | StringBinary SearchSliding Window+3 |
| Snapshot Array | Medium | 36.7% | 63.0% | ArrayHash TableBinary Search+1 |
| Design Hit Counter | Medium | 69.6% | 63.0% | ArrayBinary SearchDesign+2 |
| Wildcard Matching | Hard | 31.4% | 63.0% | StringDynamic ProgrammingGreedy+1 |
| Number of Distinct Islands | Medium | 62.7% | 63.0% | Hash TableDepth-First SearchBreadth-First Search+2 |
| Basic Calculator II | Medium | 46.7% | 63.0% | MathStringStack |
| Number of Islands | Medium | 63.8% | 63.0% | ArrayDepth-First SearchBreadth-First Search+2 |
| Single Element in a Sorted Array | Medium | 59.2% | 63.0% | ArrayBinary Search |
| Search a 2D Matrix | Medium | 53.6% | 63.0% | ArrayBinary SearchMatrix |
| Sliding Window Maximum | Hard | 48.5% | 63.0% | ArrayQueueSliding Window+2 |
| Group Anagrams | Medium | 72.2% | 63.0% | ArrayHash TableString+1 |
| Cheapest Flights Within K Stops | Medium | 41.4% | 63.0% | Dynamic ProgrammingDepth-First SearchBreadth-First Search+3 |
| Find Median from Data Stream | Hard | 54.2% | 52.8% | Two PointersDesignSorting+2 |
| Number of Atoms | Hard | 65.1% | 52.8% | Hash TableStringStack+1 |
| Open the Lock | Medium | 61.2% | 52.8% | ArrayHash TableString+1 |
| Pacific Atlantic Water Flow | Medium | 60.6% | 52.8% | ArrayDepth-First SearchBreadth-First Search+1 |
| Basic Calculator III | Hard | 53.2% | 52.8% | MathStringStack+1 |
| Increasing Triplet Subsequence | Medium | 39.2% | 52.8% | ArrayGreedy |
| Bus Routes | Hard | 47.1% | 52.8% | ArrayHash TableBreadth-First Search |
| Maximum Number of Tasks You Can Assign | Hard | 50.2% | 52.8% | ArrayTwo PointersBinary Search+4 |
| Search a 2D Matrix II | Medium | 56.9% | 52.8% | ArrayBinary SearchDivide and Conquer+1 |
| Distinct Subsequences | Hard | 51.5% | 52.8% | StringDynamic Programming |
| Buildings With an Ocean View | Medium | 80.9% | 52.8% | ArrayStackMonotonic Stack |
| Reorganize String | Medium | 56.8% | 52.8% | Hash TableStringGreedy+3 |
| Kth Largest Element in an Array | Medium | 68.8% | 52.8% | ArrayDivide and ConquerSorting+2 |
| Split Strings by Separator | Easy | 76.0% | 52.8% | ArrayString |
| Basic Calculator | Hard | 46.6% | 52.8% | MathStringStack+1 |