| Valid Parentheses | Easy | 43.7% | 100.0% | StringStack |
| LRU Cache | Medium | 46.8% | 87.5% | Hash TableLinked ListDesign+1 |
| Maximum Difference Score in a Grid | Medium | 47.7% | 87.5% | ArrayDynamic ProgrammingMatrix |
| Maximum Product of Three Numbers | Easy | 45.7% | 87.5% | ArrayMathSorting |
| Two Sum | Easy | 57.1% | 75.0% | ArrayHash Table |
| Length of the Longest Subsequence That Sums to Target | Medium | 39.3% | 75.0% | ArrayDynamic Programming |
| Sudoku Solver | Hard | 65.4% | 75.0% | ArrayHash TableBacktracking+1 |
| Rotting Oranges | Medium | 58.1% | 75.0% | ArrayBreadth-First SearchMatrix |
| Course Schedule II | Medium | 55.0% | 75.0% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Maximum Total Beauty of the Gardens | Hard | 30.3% | 75.0% | ArrayTwo PointersBinary Search+4 |
| Make String Anti-palindrome | Hard | 46.1% | 75.0% | |
| Destroy Sequential Targets | Medium | 41.7% | 75.0% | ArrayHash TableCounting |
| Most Profitable Path in a Tree | Medium | 67.3% | 75.0% | ArrayTreeDepth-First Search+2 |
| Number of Substrings With Fixed Ratio | Medium | 57.2% | 75.0% | |
| Max Area of Island | Medium | 73.8% | 75.0% | ArrayDepth-First SearchBreadth-First Search+2 |
| Basic Calculator IV | Hard | 49.7% | 75.0% | Hash TableMathString+2 |
| Number of Distinct Substrings in a String | Medium | 64.8% | 75.0% | |
| Plus One | Easy | 49.5% | 75.0% | ArrayMath |
| Count Islands With Total Value Divisible by K | Medium | 56.3% | 75.0% | ArrayDepth-First SearchBreadth-First Search+2 |
| Word Break | Medium | 49.1% | 62.5% | ArrayHash TableString+3 |
| Min Stack | Medium | 57.7% | 62.5% | StackDesign |
| Product of Array Except Self | Medium | 68.6% | 62.5% | ArrayPrefix Sum |
| Coin Change | Medium | 47.9% | 62.5% | ArrayDynamic ProgrammingBreadth-First Search |
| Top K Frequent Elements | Medium | 65.8% | 62.5% | ArrayHash TableDivide and Conquer+5 |
| Logger Rate Limiter | Easy | 76.8% | 62.5% | |
| Unique Email Addresses | Easy | 67.8% | 62.5% | ArrayHash TableString |
| Daily Temperatures | Medium | 68.3% | 62.5% | ArrayStackMonotonic Stack |
| Number of Ways to Paint N × 3 Grid | Hard | 80.5% | 62.5% | Dynamic Programming |
| 3Sum | Medium | 38.6% | 50.0% | ArrayTwo PointersSorting |
| Generate Parentheses | Medium | 78.2% | 50.0% | StringDynamic ProgrammingBacktracking |
| Group Anagrams | Medium | 72.2% | 50.0% | ArrayHash TableString+1 |
| House Robber | Medium | 52.9% | 50.0% | ArrayDynamic Programming |
| Longest Increasing Subsequence | Medium | 59.0% | 50.0% | ArrayBinary SearchDynamic Programming |
| Middle of the Linked List | Easy | 81.5% | 50.0% | Linked ListTwo Pointers |
| Russian Doll Envelopes | Hard | 37.7% | 50.0% | ArrayBinary SearchDynamic Programming+1 |
| Longest Valid Parentheses | Hard | 38.0% | 50.0% | StringDynamic ProgrammingStack |
| Maximal Rectangle | Hard | 58.1% | 50.0% | ArrayDynamic ProgrammingStack+2 |
| Valid Palindrome | Easy | 52.8% | 50.0% | Two PointersString |
| Merge Intervals | Medium | 51.1% | 50.0% | ArraySorting |
| Reverse Pairs | Hard | 33.7% | 50.0% | ArrayBinary SearchDivide and Conquer+4 |
| Strange Printer | Hard | 60.9% | 50.0% | StringDynamic Programming |
| Longest Balanced Subarray I | Medium | 65.6% | 50.0% | ArrayHash TableDivide and Conquer+2 |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 37.5% | Hash TableStringSliding Window |
| Minimum Cost For Tickets | Medium | 67.4% | 37.5% | ArrayDynamic Programming |
| Spiral Matrix | Medium | 56.1% | 37.5% | ArrayMatrixSimulation |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 37.5% | ArrayDynamic Programming |
| 132 Pattern | Medium | 34.5% | 37.5% | ArrayBinary SearchStack+2 |
| Number of Operations to Make Network Connected | Medium | 66.1% | 37.5% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Design Circular Queue | Medium | 54.0% | 37.5% | ArrayLinked ListDesign+1 |
| Get the Maximum Score | Hard | 40.8% | 37.5% | ArrayTwo PointersDynamic Programming+1 |
| Number of Longest Increasing Subsequence | Medium | 51.3% | 37.5% | ArrayDynamic ProgrammingBinary Indexed Tree+1 |
| Decode String | Medium | 62.2% | 37.5% | StringStackRecursion |
| Zigzag Conversion | Medium | 53.5% | 37.5% | String |
| Kth Largest Element in an Array | Medium | 68.8% | 37.5% | ArrayDivide and ConquerSorting+2 |
| Minimum Limit of Balls in a Bag | Medium | 66.6% | 37.5% | ArrayBinary Search |
| Lowest Common Ancestor of a Binary Tree | Medium | 68.7% | 37.5% | TreeDepth-First SearchBinary Tree |
| Next Permutation | Medium | 44.7% | 37.5% | ArrayTwo Pointers |
| Move Zeroes | Easy | 63.5% | 37.5% | ArrayTwo Pointers |
| Next Greater Element II | Medium | 67.9% | 37.5% | ArrayStackMonotonic Stack |
| Employee Free Time | Hard | 72.8% | 37.5% | |
| Minimum Deletions to Make Character Frequencies Unique | Medium | 61.4% | 37.5% | Hash TableStringGreedy+1 |
| String Compression | Medium | 59.5% | 37.5% | Two PointersString |
| Decode Ways | Medium | 37.6% | 37.5% | StringDynamic Programming |
| Cheapest Flights Within K Stops | Medium | 41.4% | 37.5% | Dynamic ProgrammingDepth-First SearchBreadth-First Search+3 |
| Shortest Path in Binary Matrix | Medium | 51.1% | 37.5% | ArrayBreadth-First SearchMatrix |
| Find Median from Data Stream | Hard | 54.2% | 37.5% | Two PointersDesignSorting+2 |
| Insert Delete GetRandom O(1) | Medium | 55.3% | 37.5% | ArrayHash TableMath+2 |
| Painting a Grid With Three Different Colors | Hard | 77.3% | 37.5% | Dynamic Programming |
| Course Schedule | Medium | 50.8% | 37.5% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Palindromic Substrings | Medium | 72.5% | 37.5% | Two PointersStringDynamic Programming |
| Valid Parenthesis String | Medium | 39.8% | 37.5% | StringDynamic ProgrammingStack+1 |