| Minimum Number of Taps to Open to Water a Garden | Hard | 51.0% | 100.0% | ArrayDynamic ProgrammingGreedy |
| Valid Parentheses | Easy | 43.7% | 95.2% | StringStack |
| Course Schedule II | Medium | 55.0% | 93.3% | Depth-First SearchBreadth-First SearchGraph+1 |
| Most Profitable Path in a Tree | Medium | 67.3% | 93.3% | ArrayTreeDepth-First Search+2 |
| Maximum Product of Three Numbers | Easy | 45.7% | 91.3% | ArrayMathSorting |
| LRU Cache | Medium | 46.8% | 89.1% | Hash TableLinked ListDesign+1 |
| Maximum Difference Score in a Grid | Medium | 47.7% | 86.8% | ArrayDynamic ProgrammingMatrix |
| Maximum Total Beauty of the Gardens | Hard | 30.3% | 86.8% | ArrayTwo PointersBinary Search+4 |
| Max Area of Island | Medium | 73.8% | 86.8% | ArrayDepth-First SearchBreadth-First Search+2 |
| Destroy Sequential Targets | Medium | 41.7% | 86.8% | ArrayHash TableCounting |
| Number of Distinct Substrings in a String | Medium | 64.8% | 86.8% | StringTrieRolling Hash+2 |
| Basic Calculator IV | Hard | 49.7% | 86.8% | Hash TableMathString+2 |
| Make String Anti-palindrome | Hard | 46.1% | 86.8% | StringGreedySorting+1 |
| Length of the Longest Subsequence That Sums to Target | Medium | 39.3% | 86.8% | ArrayDynamic Programming |
| Number of Substrings With Fixed Ratio | Medium | 57.1% | 86.8% | Hash TableMathString+1 |
| Sudoku Solver | Hard | 65.4% | 84.1% | ArrayHash TableBacktracking+1 |
| Rotting Oranges | Medium | 58.2% | 81.2% | ArrayBreadth-First SearchMatrix |
| Product of Array Except Self | Medium | 68.6% | 81.2% | ArrayPrefix Sum |
| Coin Change | Medium | 48.0% | 74.0% | ArrayDynamic ProgrammingBreadth-First Search |
| Plus One | Easy | 49.6% | 74.0% | ArrayMath |
| Two Sum | Easy | 57.1% | 74.0% | ArrayHash Table |
| Logger Rate Limiter | Easy | 76.8% | 69.5% | Hash TableDesignData Stream |
| Spiral Matrix | Medium | 56.2% | 69.5% | ArrayMatrixSimulation |
| Unique Email Addresses | Easy | 67.8% | 69.5% | ArrayHash TableString |
| Word Break | Medium | 49.1% | 69.5% | ArrayHash TableString+3 |
| Russian Doll Envelopes | Hard | 37.7% | 63.9% | ArrayBinary SearchDynamic Programming+1 |
| 3Sum | Medium | 38.6% | 63.9% | ArrayTwo PointersSorting |
| Min Stack | Medium | 57.7% | 63.9% | StackDesign |
| Heaters | Medium | 41.4% | 63.9% | ArrayTwo PointersBinary Search+1 |
| Longest Increasing Subsequence | Medium | 59.1% | 63.9% | ArrayBinary SearchDynamic Programming |
| Top K Frequent Elements | Medium | 65.9% | 63.9% | ArrayHash TableDivide and Conquer+5 |
| House Robber | Medium | 52.9% | 63.9% | ArrayDynamic Programming |
| 132 Pattern | Medium | 34.5% | 56.8% | ArrayBinary SearchStack+2 |
| Middle of the Linked List | Easy | 81.6% | 56.8% | Linked ListTwo Pointers |
| Group Anagrams | Medium | 72.2% | 56.8% | ArrayHash TableString+1 |
| Trapping Rain Water | Hard | 66.8% | 56.8% | ArrayTwo PointersDynamic Programming+2 |
| Minimum Cost For Tickets | Medium | 67.4% | 56.8% | ArrayDynamic Programming |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 56.8% | ArrayDynamic Programming |
| Daily Temperatures | Medium | 68.4% | 56.8% | ArrayStackMonotonic Stack |
| Minimum Limit of Balls in a Bag | Medium | 66.5% | 46.9% | ArrayBinary Search |
| Employee Free Time | Hard | 72.8% | 46.9% | ArrayLine SweepSorting+1 |
| Climbing Stairs | Easy | 53.9% | 46.9% | MathDynamic ProgrammingMemoization |
| Number of Operations to Make Network Connected | Medium | 66.2% | 46.9% | Depth-First SearchBreadth-First SearchUnion Find+1 |
| Get the Maximum Score | Hard | 40.8% | 46.9% | ArrayTwo PointersDynamic Programming+1 |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 46.9% | Hash TableStringSliding Window |
| Longest Valid Parentheses | Hard | 38.1% | 46.9% | StringDynamic ProgrammingStack |
| Number of Longest Increasing Subsequence | Medium | 51.4% | 46.9% | ArrayDynamic ProgrammingBinary Indexed Tree+1 |
| Design Circular Queue | Medium | 54.0% | 46.9% | ArrayLinked ListDesign+1 |
| Maximal Rectangle | Hard | 58.1% | 46.9% | ArrayDynamic ProgrammingStack+2 |
| Zigzag Conversion | Medium | 53.6% | 46.9% | String |
| Reorganize String | Medium | 56.8% | 46.9% | Hash TableStringGreedy+3 |
| Minimum Falling Path Sum | Medium | 60.8% | 46.9% | ArrayDynamic ProgrammingMatrix |
| Shortest Path in Binary Matrix | Medium | 51.1% | 46.9% | ArrayBreadth-First SearchMatrix |
| Decode String | Medium | 62.3% | 46.9% | StringStackRecursion |
| Insert Delete GetRandom O(1) | Medium | 55.3% | 46.9% | ArrayHash TableMath+2 |
| Task Scheduler | Medium | 62.7% | 46.9% | ArrayHash TableGreedy+3 |
| Largest Plus Sign | Medium | 49.1% | 46.9% | ArrayDynamic Programming |
| Serialize and Deserialize Binary Tree | Hard | 60.4% | 46.9% | StringTreeDepth-First Search+3 |
| Palindrome Linked List | Easy | 57.5% | 46.9% | Linked ListTwo PointersStack+1 |
| Merge Two Sorted Lists | Easy | 68.0% | 46.9% | Linked ListRecursion |
| Course Schedule | Medium | 50.8% | 46.9% | Depth-First SearchBreadth-First SearchGraph+1 |
| Generate Parentheses | Medium | 78.3% | 46.9% | StringDynamic ProgrammingBacktracking |
| Binary Tree Level Order Traversal | Medium | 72.2% | 46.9% | TreeBreadth-First SearchBinary Tree |
| Median of Two Sorted Arrays | Hard | 46.0% | 46.9% | ArrayBinary SearchDivide and Conquer |
| Find All Anagrams in a String | Medium | 53.3% | 46.9% | Hash TableStringSliding Window |
| Kth Largest Element in an Array | Medium | 68.8% | 46.9% | ArrayDivide and ConquerSorting+2 |
| Lowest Common Ancestor of a Binary Tree | Medium | 68.8% | 46.9% | TreeDepth-First SearchBinary Tree |
| Next Permutation | Medium | 44.8% | 46.9% | ArrayTwo Pointers |
| Move Zeroes | Easy | 63.6% | 46.9% | ArrayTwo Pointers |
| Binary Tree Zigzag Level Order Traversal | Medium | 63.2% | 46.9% | TreeBreadth-First SearchBinary Tree |
| Binary Tree Maximum Path Sum | Hard | 42.0% | 46.9% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Next Greater Element II | Medium | 67.9% | 46.9% | ArrayStackMonotonic Stack |
| Number of Islands | Medium | 63.8% | 46.9% | ArrayDepth-First SearchBreadth-First Search+2 |