| Number of Islands | Medium | 63.8% | 100.0% | ArrayDepth-First SearchBreadth-First Search+2 |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 100.0% | Hash TableStringSliding Window |
| LRU Cache | Medium | 46.8% | 98.4% | Hash TableLinked ListDesign+1 |
| Valid Parentheses | Easy | 43.7% | 96.6% | StringStack |
| Two Sum | Easy | 57.1% | 92.8% | ArrayHash Table |
| Trapping Rain Water | Hard | 66.8% | 90.6% | ArrayTwo PointersDynamic Programming+2 |
| Generate Parentheses | Medium | 78.3% | 90.6% | StringDynamic ProgrammingBacktracking |
| Merge Intervals | Medium | 51.2% | 88.3% | ArraySorting |
| Search in Rotated Sorted Array | Medium | 44.1% | 88.3% | ArrayBinary Search |
| Divide Intervals Into Minimum Number of Groups | Medium | 63.6% | 88.3% | ArrayTwo PointersGreedy+3 |
| Middle of the Linked List | Easy | 81.6% | 88.3% | Linked ListTwo Pointers |
| Maximum Number of Tasks You Can Assign | Hard | 50.2% | 85.7% | ArrayTwo PointersBinary Search+4 |
| The Winner University | Easy | 75.5% | 85.7% | Database |
| Count Good Triplets in an Array | Hard | 65.8% | 85.7% | ArrayBinary SearchDivide and Conquer+4 |
| XOR Operation in an Array | Easy | 87.4% | 85.7% | MathBit Manipulation |
| Number of Ways to Separate Numbers | Hard | 21.6% | 85.7% | StringDynamic ProgrammingPrefix Sum |
| Minimum Operations to Make Array Equal II | Medium | 33.0% | 85.7% | ArrayMathGreedy |
| Count Elements With Maximum Frequency | Easy | 79.8% | 85.7% | ArrayHash TableCounting |
| Circular Permutation in Binary Representation | Medium | 72.6% | 85.7% | MathBacktrackingBit Manipulation |
| Minimum Number of Operations to Make Arrays Similar | Hard | 61.5% | 85.7% | ArrayGreedySorting |
| Maximum Length Substring With Two Occurrences | Easy | 65.2% | 85.7% | Hash TableStringSliding Window |
| Find the N-th Value After K Seconds | Medium | 53.8% | 85.7% | ArrayMathSimulation+2 |
| Group Anagrams | Medium | 72.2% | 82.9% | ArrayHash TableString+1 |
| Word Break | Medium | 49.1% | 82.9% | ArrayHash TableString+3 |
| Maximum Distance Between Unequal Words in Array I | Easy | 82.5% | 79.8% | ArrayString |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 76.2% | ArrayDynamic Programming |
| Coin Change | Medium | 48.0% | 76.2% | ArrayDynamic ProgrammingBreadth-First Search |
| Advantage Shuffle | Medium | 54.3% | 72.1% | ArrayTwo PointersGreedy+1 |
| Sort Colors | Medium | 69.2% | 72.1% | ArrayTwo PointersSorting |
| Longest Palindromic Substring | Medium | 37.4% | 72.1% | Two PointersStringDynamic Programming |
| Combination Sum | Medium | 76.1% | 72.1% | ArrayBacktracking |
| Longest Increasing Subsequence | Medium | 59.1% | 72.1% | ArrayBinary SearchDynamic Programming |
| Container With Most Water | Medium | 59.6% | 72.1% | ArrayTwo PointersGreedy |
| Longest Consecutive Sequence | Medium | 47.0% | 72.1% | ArrayHash TableUnion-Find |
| Max Stack | Hard | 45.9% | 72.1% | Linked ListStackDesign+2 |
| Zigzag Conversion | Medium | 53.6% | 67.2% | String |
| LFU Cache | Hard | 48.6% | 67.2% | Hash TableLinked ListDesign+1 |
| 3Sum | Medium | 38.6% | 67.2% | ArrayTwo PointersSorting |
| Spiral Matrix | Medium | 56.2% | 67.2% | ArrayMatrixSimulation |
| Binary Tree Zigzag Level Order Traversal | Medium | 63.2% | 67.2% | TreeBreadth-First SearchBinary Tree |
| Median of Two Sorted Arrays | Hard | 46.0% | 67.2% | ArrayBinary SearchDivide and Conquer |
| Find Median from Data Stream | Hard | 54.2% | 67.2% | Two PointersDesignSorting+2 |
| Kth Largest Element in an Array | Medium | 68.8% | 67.2% | ArrayDivide and ConquerSorting+2 |
| First Unique Character in a String | Easy | 65.1% | 67.2% | Hash TableStringQueue+1 |
| Sort the Matrix Diagonally | Medium | 83.2% | 67.2% | ArraySortingMatrix |
| Course Schedule | Medium | 50.8% | 61.2% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Subarray Sum Equals K | Medium | 46.8% | 61.2% | ArrayHash TablePrefix Sum |
| Permutation in String | Medium | 48.5% | 61.2% | Hash TableTwo PointersString+1 |
| Move Zeroes | Easy | 63.6% | 61.2% | ArrayTwo Pointers |
| Merge k Sorted Lists | Hard | 58.9% | 61.2% | Linked ListDivide and ConquerHeap (Priority Queue)+1 |
| Reverse Nodes in k-Group | Hard | 65.4% | 61.2% | Linked ListRecursion |
| Add Binary | Easy | 57.7% | 61.2% | MathStringBit Manipulation+1 |
| Valid Sudoku | Medium | 64.2% | 61.2% | ArrayHash TableMatrix |
| Binary Tree Right Side View | Medium | 69.5% | 61.2% | TreeDepth-First SearchBreadth-First Search+1 |
| Subsets II | Medium | 60.9% | 61.2% | ArrayBacktrackingBit Manipulation |
| Design Hit Counter | Medium | 69.6% | 61.2% | ArrayBinary SearchDesign+2 |
| Trapping Rain Water II | Hard | 64.0% | 61.2% | ArrayBreadth-First SearchHeap (Priority Queue)+1 |
| Integer to Roman | Medium | 70.5% | 61.2% | Hash TableMathString |
| Rotting Oranges | Medium | 58.2% | 61.2% | ArrayBreadth-First SearchMatrix |
| Diagonal Traverse | Medium | 67.0% | 61.2% | ArrayMatrixSimulation |
| Palindromic Substrings | Medium | 72.6% | 61.2% | Two PointersStringDynamic Programming |
| Longest Common Prefix | Easy | 47.1% | 61.2% | ArrayStringTrie |
| Top K Frequent Elements | Medium | 65.9% | 61.2% | ArrayHash TableDivide and Conquer+5 |
| Maximum Sum of Distinct Subarrays With Length K | Medium | 42.8% | 61.2% | ArrayHash TableSliding Window |
| Construct Binary Tree from Inorder and Postorder Traversal | Medium | 68.1% | 61.2% | ArrayHash TableDivide and Conquer+2 |
| Maximum Subarray | Medium | 53.0% | 61.2% | ArrayDivide and ConquerDynamic Programming |
| First Missing Positive | Hard | 42.5% | 53.6% | ArrayHash Table |
| Search a 2D Matrix | Medium | 53.6% | 53.6% | ArrayBinary SearchMatrix |
| Minimum Window Substring | Hard | 47.0% | 53.6% | Hash TableStringSliding Window |
| Course Schedule II | Medium | 55.0% | 53.6% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Wildcard Matching | Hard | 31.4% | 53.6% | StringDynamic ProgrammingGreedy+1 |
| Jump Game | Medium | 40.5% | 53.6% | ArrayDynamic ProgrammingGreedy |
| Insert Interval | Medium | 44.8% | 53.6% | Array |
| Minimum Remove to Make Valid Parentheses | Medium | 71.3% | 53.6% | StringStack |
| Decode Ways | Medium | 37.6% | 53.6% | StringDynamic Programming |
| Find Minimum in Rotated Sorted Array | Medium | 53.8% | 53.6% | ArrayBinary Search |
| The Maze | Medium | 60.3% | 53.6% | ArrayDepth-First SearchBreadth-First Search+1 |
| Remove All Adjacent Duplicates in String II | Medium | 60.9% | 53.6% | StringStack |
| Set Matrix Zeroes | Medium | 62.5% | 53.6% | ArrayHash TableMatrix |
| Next Permutation | Medium | 44.8% | 53.6% | ArrayTwo Pointers |
| Remove K Digits | Medium | 36.4% | 53.6% | StringStackGreedy+1 |
| Next Greater Element III | Medium | 35.2% | 53.6% | MathTwo PointersString |
| Rotate Array | Medium | 44.5% | 53.6% | ArrayMathTwo Pointers |
| House Robber | Medium | 52.9% | 53.6% | ArrayDynamic Programming |
| Daily Temperatures | Medium | 68.4% | 53.6% | ArrayStackMonotonic Stack |
| Min Stack | Medium | 57.7% | 53.6% | StackDesign |
| Remove Nth Node From End of List | Medium | 51.0% | 53.6% | Linked ListTwo Pointers |
| Triangle | Medium | 59.9% | 53.6% | ArrayDynamic Programming |
| Meeting Rooms II | Medium | 52.6% | 53.6% | ArrayTwo PointersGreedy+3 |
| Valid Palindrome | Easy | 52.8% | 53.6% | Two PointersString |
| Largest Rectangle in Histogram | Hard | 49.4% | 53.6% | ArrayStackMonotonic Stack |
| Sliding Window Maximum | Hard | 48.5% | 43.0% | ArrayQueueSliding Window+2 |
| Subarray Product Less Than K | Medium | 53.9% | 43.0% | ArrayBinary SearchSliding Window+1 |
| Word Search | Medium | 46.9% | 43.0% | ArrayStringBacktracking+2 |
| Pow(x, n) | Medium | 38.3% | 43.0% | MathRecursion |
| Longest Common Subsequence | Medium | 58.9% | 43.0% | StringDynamic Programming |
| Flatten Nested List Iterator | Medium | 65.6% | 43.0% | StackTreeDepth-First Search+3 |
| Best Time to Buy and Sell Stock II | Medium | 70.8% | 43.0% | ArrayDynamic ProgrammingGreedy |
| Basic Calculator II | Medium | 46.7% | 43.0% | MathStringStack |
| Contiguous Array | Medium | 50.8% | 43.0% | ArrayHash TablePrefix Sum |
| Find K Pairs with Smallest Sums | Medium | 41.6% | 43.0% | ArrayHeap (Priority Queue) |
| Non-decreasing Array | Medium | 25.4% | 43.0% | Array |
| Search in Rotated Sorted Array II | Medium | 39.8% | 43.0% | ArrayBinary Search |
| Reverse Integer | Medium | 31.5% | 43.0% | Math |
| Count Different Palindromic Subsequences | Hard | 47.5% | 43.0% | StringDynamic Programming |
| Reverse Linked List II | Medium | 51.0% | 43.0% | Linked List |
| Maximum Product Subarray | Medium | 36.0% | 43.0% | ArrayDynamic Programming |
| Rising Temperature | Easy | 51.0% | 43.0% | Database |
| Number of Islands II | Hard | 40.4% | 43.0% | ArrayHash TableUnion-Find |
| Remove Letter To Equalize Frequency | Easy | 19.2% | 43.0% | Hash TableStringCounting |
| Find the Winner of the Circular Game | Medium | 82.2% | 43.0% | ArrayMathRecursion+2 |
| Roman to Integer | Easy | 66.3% | 43.0% | Hash TableMathString |
| Subsets | Medium | 82.1% | 43.0% | ArrayBacktrackingBit Manipulation |
| Diameter of Binary Tree | Easy | 65.1% | 43.0% | TreeDepth-First SearchBinary Tree |
| Linked List Cycle | Easy | 53.9% | 43.0% | Hash TableLinked ListTwo Pointers |
| Populating Next Right Pointers in Each Node | Medium | 66.9% | 43.0% | Linked ListTreeDepth-First Search+2 |
| Edit Distance | Medium | 60.2% | 43.0% | StringDynamic Programming |
| Find Peak Element | Medium | 46.8% | 43.0% | ArrayBinary Search |
| Relative Sort Array | Easy | 75.1% | 43.0% | ArrayHash TableSorting+1 |
| Find All Duplicates in an Array | Medium | 76.8% | 43.0% | ArrayHash TableSorting |
| N-Queens II | Hard | 78.2% | 43.0% | Backtracking |
| Sort Characters By Frequency | Medium | 75.1% | 43.0% | Hash TableStringSorting+3 |
| Find All Anagrams in a String | Medium | 53.3% | 43.0% | Hash TableStringSliding Window |
| Number of Distinct Islands | Medium | 62.7% | 43.0% | ArrayHash TableDepth-First Search+5 |
| Product of Array Except Self | Medium | 68.6% | 43.0% | ArrayPrefix Sum |
| Copy List with Random Pointer | Medium | 62.4% | 43.0% | Hash TableLinked List |
| Longest Substring with At Least K Repeating Characters | Medium | 46.1% | 43.0% | Hash TableStringDivide and Conquer+1 |
| Reconstruct Itinerary | Hard | 44.3% | 43.0% | ArrayStringDepth-First Search+4 |
| Meeting Rooms III | Hard | 51.6% | 43.0% | ArrayHash TableSorting+2 |
| Combination Sum II | Medium | 59.0% | 43.0% | ArrayBacktracking |
| Candy | Hard | 48.0% | 43.0% | ArrayGreedy |
| Capacity To Ship Packages Within D Days | Medium | 73.5% | 43.0% | ArrayBinary Search |
| Asteroid Collision | Medium | 47.2% | 43.0% | ArrayStackSimulation |
| Decode String | Medium | 62.3% | 43.0% | StringStackRecursion |
| Nearest Exit from Entrance in Maze | Medium | 48.3% | 43.0% | ArrayBreadth-First SearchMatrix |
| Furthest Building You Can Reach | Medium | 50.7% | 43.0% | ArrayGreedyHeap (Priority Queue) |
| Remove Duplicates from Sorted Array | Easy | 62.3% | 43.0% | ArrayTwo Pointers |
| Bus Routes | Hard | 47.1% | 43.0% | ArrayHash TableBreadth-First Search |
| Find the Duplicate Number | Medium | 64.0% | 43.0% | ArrayTwo PointersBinary Search+1 |
| Perfect Squares | Medium | 56.3% | 43.0% | MathDynamic ProgrammingBreadth-First Search |
| Basic Calculator | Hard | 46.6% | 43.0% | MathStringStack+1 |
| Degree of an Array | Easy | 58.2% | 43.0% | ArrayHash Table |
| Vertical Order Traversal of a Binary Tree | Hard | 53.3% | 43.0% | Hash TableTreeDepth-First Search+3 |
| Cheapest Flights Within K Stops | Medium | 41.4% | 43.0% | Dynamic ProgrammingDepth-First SearchBreadth-First Search+3 |