| Longest Non-decreasing Subarray From Two Arrays | Medium | 31.0% | 100.0% | ArrayDynamic Programming |
| Binary Tree Maximum Path Sum | Hard | 42.0% | 98.7% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Minimum Knight Moves | Medium | 41.8% | 93.4% | Breadth-First Search |
| Delete and Earn | Medium | 57.1% | 93.4% | ArrayHash TableDynamic Programming |
| Palindromic Substrings | Medium | 72.6% | 86.5% | Two PointersStringDynamic Programming |
| Sliding Window Maximum | Hard | 48.5% | 85.3% | ArrayQueueSliding Window+2 |
| Count Palindromic Subsequences | Hard | 41.0% | 81.3% | StringDynamic Programming |
| LFU Cache | Hard | 48.6% | 79.8% | Hash TableLinked ListDesign+1 |
| Minimum Equal Sum of Two Arrays After Replacing Zeros | Medium | 50.2% | 79.8% | ArrayGreedy |
| Minimum Operations to Make Numbers Non-positive | Hard | 44.1% | 78.1% | ArrayBinary Search |
| Number of Good Binary Strings | Medium | 52.8% | 76.4% | Dynamic Programming |
| Maximum Total Damage With Spell Casting | Medium | 45.0% | 76.4% | ArrayHash TableTwo Pointers+4 |
| LRU Cache | Medium | 46.8% | 74.4% | Hash TableLinked ListDesign+1 |
| Best Position for a Service Centre | Hard | 35.1% | 74.4% | ArrayMathGeometry+1 |
| Maximum Length of Repeated Subarray | Medium | 51.3% | 74.4% | ArrayBinary SearchDynamic Programming+3 |
| Minimum Costs Using the Train Line | Hard | 77.9% | 74.4% | ArrayDynamic Programming |
| Evaluate Division | Medium | 64.0% | 72.3% | ArrayStringDepth-First Search+4 |
| First Completely Painted Row or Column | Medium | 63.9% | 72.3% | ArrayHash TableMatrix |
| Merge Intervals | Medium | 51.2% | 70.0% | ArraySorting |
| Longest String Chain | Medium | 62.8% | 70.0% | ArrayHash TableTwo Pointers+3 |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 67.4% | ArrayDynamic Programming |
| Find the Duplicate Number | Medium | 64.0% | 67.4% | ArrayTwo PointersBinary Search+1 |
| Serialize and Deserialize Binary Tree | Hard | 60.4% | 67.4% | StringTreeDepth-First Search+3 |
| Insert Delete GetRandom O(1) | Medium | 55.3% | 64.5% | ArrayHash TableMath+2 |
| Evaluate Reverse Polish Notation | Medium | 57.1% | 64.5% | ArrayMathStack |
| Parallel Courses III | Hard | 66.8% | 61.1% | ArrayDynamic ProgrammingGraph+1 |
| Number of Islands | Medium | 63.8% | 61.1% | ArrayDepth-First SearchBreadth-First Search+2 |
| Length of Longest Subarray With at Most K Frequency | Medium | 56.4% | 61.1% | ArrayHash TableSliding Window |
| Sudoku Solver | Hard | 65.4% | 61.1% | ArrayHash TableBacktracking+1 |
| Meeting Scheduler | Medium | 55.2% | 57.1% | ArrayTwo PointersSorting |
| Employee Free Time | Hard | 72.8% | 57.1% | ArrayLine SweepSorting+1 |
| Couples Holding Hands | Hard | 59.2% | 57.1% | GreedyDepth-First SearchBreadth-First Search+2 |
| Robot Room Cleaner | Hard | 77.9% | 57.1% | BacktrackingInteractive |
| Find Median from Data Stream | Hard | 54.2% | 57.1% | Two PointersDesignSorting+2 |
| Group Anagrams | Medium | 72.2% | 57.1% | ArrayHash TableString+1 |
| Validate Binary Search Tree | Medium | 35.4% | 57.1% | TreeDepth-First SearchBinary Search Tree+1 |
| Permutations | Medium | 81.7% | 57.1% | ArrayBacktracking |
| Merge k Sorted Lists | Hard | 58.9% | 57.1% | Linked ListDivide and ConquerHeap (Priority Queue)+1 |
| Binary Tree Zigzag Level Order Traversal | Medium | 63.2% | 52.2% | TreeBreadth-First SearchBinary Tree |
| Search Suggestions System | Medium | 65.1% | 52.2% | ArrayStringBinary Search+3 |
| Trapping Rain Water | Hard | 66.8% | 52.2% | ArrayTwo PointersDynamic Programming+2 |
| N-Queens | Hard | 75.0% | 52.2% | ArrayBacktracking |
| Design Search Autocomplete System | Hard | 49.7% | 52.2% | StringDepth-First SearchDesign+4 |
| Regular Expression Matching | Hard | 30.5% | 52.2% | StringDynamic ProgrammingRecursion |
| Best Time to Buy and Sell Stock II | Medium | 70.8% | 52.2% | ArrayDynamic ProgrammingGreedy |
| Design Circular Queue | Medium | 54.0% | 52.2% | ArrayLinked ListDesign+1 |
| Fizz Buzz | Easy | 75.3% | 52.2% | MathStringSimulation |
| Combination Sum | Medium | 76.1% | 52.2% | ArrayBacktracking |
| Best Time to Buy and Sell Stock III | Hard | 53.2% | 52.2% | ArrayDynamic Programming |
| Find Servers That Handled Most Number of Requests | Hard | 45.2% | 45.9% | ArrayGreedyHeap (Priority Queue)+1 |
| Design Excel Sum Formula | Hard | 39.9% | 45.9% | ArrayHash TableString+4 |
| Implement Trie (Prefix Tree) | Medium | 69.2% | 45.9% | Hash TableStringDesign+1 |
| Perfect Squares | Medium | 56.3% | 45.9% | MathDynamic ProgrammingBreadth-First Search |
| Sort Items by Groups Respecting Dependencies | Hard | 65.6% | 45.9% | Depth-First SearchBreadth-First SearchGraph+1 |
| Climbing Stairs | Easy | 53.9% | 45.9% | MathDynamic ProgrammingMemoization |
| Letter Combinations of a Phone Number | Medium | 65.5% | 45.9% | Hash TableStringBacktracking |
| Median of Two Sorted Arrays | Hard | 46.0% | 45.9% | ArrayBinary SearchDivide and Conquer |
| Minimum Height Trees | Medium | 42.4% | 45.9% | Depth-First SearchBreadth-First SearchGraph+1 |
| Count Ways To Build Good Strings | Medium | 59.0% | 45.9% | Dynamic Programming |
| Maximal Square | Medium | 50.0% | 45.9% | ArrayDynamic ProgrammingMatrix |
| Alien Dictionary | Hard | 37.1% | 45.9% | ArrayStringDepth-First Search+3 |
| Longest Increasing Path in a Matrix | Hard | 56.3% | 45.9% | ArrayDynamic ProgrammingDepth-First Search+5 |
| House Robber | Medium | 52.9% | 45.9% | ArrayDynamic Programming |
| Transform to Chessboard | Hard | 51.2% | 45.9% | ArrayMathBit Manipulation+1 |
| 3Sum | Medium | 38.6% | 45.9% | ArrayTwo PointersSorting |
| Sqrt(x) | Easy | 41.4% | 45.9% | MathBinary Search |
| Design Front Middle Back Queue | Medium | 56.9% | 45.9% | ArrayLinked ListDesign+2 |
| Word Search | Medium | 46.9% | 45.9% | ArrayStringBacktracking+2 |
| Moving Average from Data Stream | Easy | 80.2% | 45.9% | ArrayDesignQueue+1 |
| Consecutive Numbers Sum | Hard | 42.6% | 38.9% | MathEnumeration |
| Asteroid Collision | Medium | 47.2% | 37.1% | ArrayStackSimulation |
| Insert Delete GetRandom O(1) - Duplicates allowed | Hard | 36.4% | 37.1% | ArrayHash TableMath+2 |
| Count Number of Maximum Bitwise-OR Subsets | Medium | 89.6% | 37.1% | ArrayBacktrackingBit Manipulation+1 |
| Search a 2D Matrix II | Medium | 56.9% | 37.1% | ArrayBinary SearchDivide and Conquer+1 |
| Word Ladder II | Hard | 27.5% | 37.1% | Hash TableStringBacktracking+1 |
| Longest Common Subsequence | Medium | 58.9% | 37.1% | StringDynamic Programming |
| Container With Most Water | Medium | 59.6% | 37.1% | ArrayTwo PointersGreedy |
| Paint House | Medium | 64.3% | 37.1% | ArrayDynamic Programming |
| Max Points on a Line | Hard | 30.3% | 37.1% | ArrayHash TableMath+1 |
| Pow(x, n) | Medium | 38.3% | 37.1% | MathRecursion |
| Rank Transform of a Matrix | Hard | 42.1% | 37.1% | ArrayUnion FindGraph+3 |
| Longest Increasing Subsequence | Medium | 59.1% | 37.1% | ArrayBinary SearchDynamic Programming |
| Rotting Oranges | Medium | 58.2% | 37.1% | ArrayBreadth-First SearchMatrix |
| Populating Next Right Pointers in Each Node II | Medium | 57.1% | 37.1% | Linked ListTreeDepth-First Search+2 |
| Reorganize String | Medium | 56.8% | 37.1% | Hash TableStringGreedy+3 |
| The Skyline Problem | Hard | 45.0% | 37.1% | ArrayDivide and ConquerBinary Indexed Tree+4 |
| Permutations II | Medium | 63.0% | 37.1% | ArrayBacktrackingSorting |
| Simplify Path | Medium | 50.0% | 37.1% | StringStack |
| Subarray Sums Divisible by K | Medium | 56.1% | 37.1% | ArrayHash TablePrefix Sum |
| Bus Routes | Hard | 47.1% | 37.1% | ArrayHash TableBreadth-First Search |
| Knight Probability in Chessboard | Medium | 56.9% | 37.1% | Dynamic Programming |
| Best Time to Buy and Sell Stock IV | Hard | 49.5% | 37.1% | ArrayDynamic Programming |
| Egg Drop With 2 Eggs and N Floors | Medium | 74.6% | 37.1% | MathDynamic Programming |
| Populating Next Right Pointers in Each Node | Medium | 66.9% | 37.1% | Linked ListTreeDepth-First Search+2 |
| Basic Calculator | Hard | 46.6% | 37.1% | MathStringStack+1 |
| Course Schedule II | Medium | 55.0% | 37.1% | Depth-First SearchBreadth-First SearchGraph+1 |
| Course Schedule | Medium | 50.8% | 37.1% | Depth-First SearchBreadth-First SearchGraph+1 |
| Best Time to Buy and Sell Stock with Transaction Fee | Medium | 71.7% | 37.1% | ArrayDynamic ProgrammingGreedy |
| Open the Lock | Medium | 61.2% | 37.1% | ArrayHash TableString+1 |
| Koko Eating Bananas | Medium | 49.7% | 37.1% | ArrayBinary Search |
| Integer to Roman | Medium | 70.5% | 37.1% | Hash TableMathString |