| Longest Substring Without Repeating Characters | Medium | 38.5% | 100.0% | Hash TableStringSliding Window |
| LRU Cache | Medium | 46.8% | 100.0% | Hash TableLinked ListDesign+1 |
| Two Sum | Easy | 57.1% | 87.5% | ArrayHash Table |
| Valid Parentheses | Easy | 43.7% | 87.5% | StringStack |
| Generate Parentheses | Medium | 78.2% | 87.5% | StringDynamic ProgrammingBacktracking |
| Trapping Rain Water | Hard | 66.8% | 87.5% | ArrayTwo PointersDynamic Programming+2 |
| Word Break | Medium | 49.1% | 87.5% | ArrayHash TableString+3 |
| Number of Islands | Medium | 63.8% | 87.5% | ArrayDepth-First SearchBreadth-First Search+2 |
| Divide Intervals Into Minimum Number of Groups | Medium | 63.6% | 87.5% | ArrayTwo PointersGreedy+3 |
| Median of Two Sorted Arrays | Hard | 45.9% | 75.0% | ArrayBinary SearchDivide and Conquer |
| Longest Palindromic Substring | Medium | 37.3% | 75.0% | Two PointersStringDynamic Programming |
| Search in Rotated Sorted Array | Medium | 44.1% | 75.0% | ArrayBinary Search |
| Valid Sudoku | Medium | 64.1% | 75.0% | ArrayHash TableMatrix |
| Combination Sum | Medium | 76.1% | 75.0% | ArrayBacktracking |
| Number of Ways to Separate Numbers | Hard | 21.6% | 75.0% | StringDynamic ProgrammingSuffix Array |
| Group Anagrams | Medium | 72.2% | 75.0% | ArrayHash TableString+1 |
| Merge Intervals | Medium | 51.1% | 75.0% | ArraySorting |
| Longest Consecutive Sequence | Medium | 47.0% | 75.0% | ArrayHash TableUnion-Find |
| The Winner University | Easy | 75.5% | 75.0% | |
| Count Good Triplets in an Array | Hard | 65.8% | 75.0% | ArrayBinary SearchDivide and Conquer+4 |
| Coin Change | Medium | 47.9% | 75.0% | ArrayDynamic ProgrammingBreadth-First Search |
| Minimum Number of Operations to Make Arrays Similar | Hard | 61.5% | 75.0% | ArrayGreedySorting |
| Minimum Operations to Make Array Equal II | Medium | 33.0% | 75.0% | ArrayMathGreedy |
| Max Stack | Hard | 45.9% | 75.0% | |
| Maximum Number of Tasks You Can Assign | Hard | 50.2% | 75.0% | ArrayTwo PointersBinary Search+4 |
| Middle of the Linked List | Easy | 81.5% | 75.0% | Linked ListTwo Pointers |
| Count Elements With Maximum Frequency | Easy | 79.8% | 75.0% | ArrayHash TableCounting |
| Maximum Length Substring With Two Occurrences | Easy | 65.1% | 75.0% | Hash TableStringSliding Window |
| Circular Permutation in Binary Representation | Medium | 72.6% | 75.0% | MathBacktrackingBit Manipulation |
| Find the N-th Value After K Seconds | Medium | 53.8% | 75.0% | ArrayMathSimulation+2 |
| XOR Operation in an Array | Easy | 87.4% | 75.0% | MathBit Manipulation |
| Maximum Distance Between Unequal Words in Array I | Easy | 82.5% | 75.0% | |
| Container With Most Water | Medium | 59.5% | 62.5% | ArrayTwo PointersGreedy |
| 3Sum | Medium | 38.6% | 62.5% | ArrayTwo PointersSorting |
| Merge k Sorted Lists | Hard | 58.8% | 62.5% | Linked ListDivide and ConquerHeap (Priority Queue)+1 |
| Reverse Nodes in k-Group | Hard | 65.3% | 62.5% | Linked ListRecursion |
| First Missing Positive | Hard | 42.4% | 62.5% | ArrayHash Table |
| Spiral Matrix | Medium | 56.1% | 62.5% | ArrayMatrixSimulation |
| Add Binary | Easy | 57.6% | 62.5% | MathStringBit Manipulation+1 |
| Sort Colors | Medium | 69.1% | 62.5% | ArrayTwo PointersSorting |
| Minimum Window Substring | Hard | 46.9% | 62.5% | Hash TableStringSliding Window |
| Binary Tree Zigzag Level Order Traversal | Medium | 63.1% | 62.5% | TreeBreadth-First SearchBinary Tree |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 62.5% | ArrayDynamic Programming |
| Rotate Array | Medium | 44.4% | 62.5% | ArrayMathTwo Pointers |
| House Robber | Medium | 52.9% | 62.5% | ArrayDynamic Programming |
| Binary Tree Right Side View | Medium | 69.5% | 62.5% | TreeDepth-First SearchBreadth-First Search+1 |
| Course Schedule II | Medium | 55.0% | 62.5% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Kth Largest Element in an Array | Medium | 68.8% | 62.5% | ArrayDivide and ConquerSorting+2 |
| Wildcard Matching | Hard | 31.3% | 62.5% | StringDynamic ProgrammingGreedy+1 |
| Flatten Nested List Iterator | Medium | 65.6% | 62.5% | StackTreeDepth-First Search+3 |
| Top K Frequent Elements | Medium | 65.8% | 62.5% | ArrayHash TableDivide and Conquer+5 |
| First Unique Character in a String | Easy | 65.0% | 62.5% | Hash TableStringQueue+1 |
| LFU Cache | Hard | 48.6% | 62.5% | Hash TableLinked ListDesign+1 |
| Subarray Sum Equals K | Medium | 46.8% | 62.5% | ArrayHash TablePrefix Sum |
| Daily Temperatures | Medium | 68.3% | 62.5% | ArrayStackMonotonic Stack |
| Longest Common Subsequence | Medium | 58.9% | 62.5% | StringDynamic Programming |
| Longest Increasing Subsequence | Medium | 59.0% | 62.5% | ArrayBinary SearchDynamic Programming |
| Insert Interval | Medium | 44.7% | 62.5% | Array |
| Zigzag Conversion | Medium | 53.5% | 62.5% | String |
| Maximum Sum of Distinct Subarrays With Length K | Medium | 42.8% | 62.5% | ArrayHash TableSliding Window |
| Trapping Rain Water II | Hard | 64.0% | 62.5% | ArrayBreadth-First SearchHeap (Priority Queue)+1 |
| Integer to Roman | Medium | 70.4% | 62.5% | Hash TableMathString |
| Palindromic Substrings | Medium | 72.5% | 62.5% | Two PointersStringDynamic Programming |
| Find Median from Data Stream | Hard | 54.2% | 62.5% | Two PointersDesignSorting+2 |
| Design Hit Counter | Medium | 69.6% | 62.5% | |
| Rotting Oranges | Medium | 58.1% | 62.5% | ArrayBreadth-First SearchMatrix |
| Diagonal Traverse | Medium | 67.0% | 62.5% | ArrayMatrixSimulation |
| Sort the Matrix Diagonally | Medium | 83.2% | 62.5% | ArraySortingMatrix |
| Longest Common Prefix | Easy | 47.1% | 50.0% | ArrayStringTrie |
| Pow(x, n) | Medium | 38.2% | 50.0% | MathRecursion |
| Search a 2D Matrix | Medium | 53.5% | 50.0% | ArrayBinary SearchMatrix |
| Word Search | Medium | 46.8% | 50.0% | ArrayStringBacktracking+2 |
| Largest Rectangle in Histogram | Hard | 49.3% | 50.0% | ArrayStackMonotonic Stack |
| Decode Ways | Medium | 37.6% | 50.0% | StringDynamic Programming |
| Best Time to Buy and Sell Stock II | Medium | 70.7% | 50.0% | ArrayDynamic ProgrammingGreedy |
| Copy List with Random Pointer | Medium | 62.4% | 50.0% | Hash TableLinked List |
| Min Stack | Medium | 57.7% | 50.0% | StackDesign |
| Course Schedule | Medium | 50.8% | 50.0% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Product of Array Except Self | Medium | 68.6% | 50.0% | ArrayPrefix Sum |
| Move Zeroes | Easy | 63.5% | 50.0% | ArrayTwo Pointers |
| Flatten Deeply Nested Array | Medium | 65.5% | 50.0% | |
| Koko Eating Bananas | Medium | 49.7% | 50.0% | ArrayBinary Search |
| Rotate Image | Medium | 79.3% | 50.0% | ArrayMathMatrix |
| Subsets II | Medium | 60.9% | 50.0% | ArrayBacktrackingBit Manipulation |
| Basic Calculator II | Medium | 46.6% | 50.0% | MathStringStack |
| Jump Game | Medium | 40.5% | 50.0% | ArrayDynamic ProgrammingGreedy |
| Contiguous Array | Medium | 50.8% | 50.0% | ArrayHash TablePrefix Sum |
| Minimum Remove to Make Valid Parentheses | Medium | 71.3% | 50.0% | StringStack |
| Triangle | Medium | 59.8% | 50.0% | ArrayDynamic Programming |
| Combination Sum II | Medium | 59.0% | 50.0% | ArrayBacktracking |
| Find Minimum in Rotated Sorted Array | Medium | 53.8% | 50.0% | ArrayBinary Search |
| The Maze | Medium | 60.3% | 50.0% | |
| Remove All Adjacent Duplicates in String II | Medium | 60.9% | 50.0% | StringStack |
| Asteroid Collision | Medium | 47.1% | 50.0% | ArrayStackSimulation |
| Remove Nth Node From End of List | Medium | 51.0% | 50.0% | Linked ListTwo Pointers |
| Set Matrix Zeroes | Medium | 62.4% | 50.0% | ArrayHash TableMatrix |
| Construct Binary Tree from Inorder and Postorder Traversal | Medium | 68.0% | 50.0% | ArrayHash TableDivide and Conquer+2 |
| Capacity To Ship Packages Within D Days | Medium | 73.5% | 50.0% | ArrayBinary Search |
| Remove K Digits | Medium | 36.4% | 50.0% | StringStackGreedy+1 |
| Next Greater Element III | Medium | 35.1% | 50.0% | MathTwo PointersString |
| Next Permutation | Medium | 44.7% | 50.0% | ArrayTwo Pointers |
| Permutation in String | Medium | 48.4% | 50.0% | Hash TableTwo PointersString+1 |
| Maximum Subarray | Medium | 53.0% | 37.5% | ArrayDivide and ConquerDynamic Programming |
| Interleaving String | Medium | 43.5% | 37.5% | StringDynamic Programming |
| Path Sum II | Medium | 61.7% | 37.5% | BacktrackingTreeDepth-First Search+1 |
| Populating Next Right Pointers in Each Node | Medium | 66.8% | 37.5% | Linked ListTreeDepth-First Search+2 |
| Partition Equal Subset Sum | Medium | 49.2% | 37.5% | ArrayDynamic Programming |
| Boundary of Binary Tree | Medium | 47.9% | 37.5% | |
| Degree of an Array | Easy | 58.2% | 37.5% | ArrayHash Table |
| Keys and Rooms | Medium | 75.5% | 37.5% | Depth-First SearchBreadth-First SearchGraph Theory |
| Boats to Save People | Medium | 61.4% | 37.5% | ArrayTwo PointersGreedy+1 |
| Sort Characters By Frequency | Medium | 75.1% | 37.5% | Hash TableStringSorting+3 |
| Find Peak Element | Medium | 46.8% | 37.5% | ArrayBinary Search |
| Find K Pairs with Smallest Sums | Medium | 41.5% | 37.5% | ArrayHeap (Priority Queue) |
| Non-decreasing Array | Medium | 25.4% | 37.5% | Array |
| Search in Rotated Sorted Array II | Medium | 39.7% | 37.5% | ArrayBinary Search |
| Reverse Integer | Medium | 31.5% | 37.5% | Math |
| Count Different Palindromic Subsequences | Hard | 47.5% | 37.5% | StringDynamic Programming |
| Next Greater Element II | Medium | 67.9% | 37.5% | ArrayStackMonotonic Stack |
| Reverse Linked List II | Medium | 51.0% | 37.5% | Linked List |
| Maximum Product Subarray | Medium | 36.0% | 37.5% | ArrayDynamic Programming |
| Remove Letter To Equalize Frequency | Easy | 19.2% | 37.5% | Hash TableStringCounting |
| Find the Winner of the Circular Game | Medium | 82.2% | 37.5% | ArrayMathRecursion+2 |
| Meeting Rooms II | Medium | 52.5% | 37.5% | |
| Subsets | Medium | 82.0% | 37.5% | ArrayBacktrackingBit Manipulation |
| Diameter of Binary Tree | Easy | 65.0% | 37.5% | TreeDepth-First SearchBinary Tree |
| Number of Islands II | Hard | 40.4% | 37.5% | |
| Word Ladder | Hard | 44.9% | 37.5% | Hash TableStringBreadth-First Search |
| Roman to Integer | Easy | 66.2% | 37.5% | Hash TableMathString |
| Distinct Subsequences | Hard | 51.5% | 37.5% | StringDynamic Programming |
| Valid Palindrome | Easy | 52.8% | 37.5% | Two PointersString |
| Rising Temperature | Easy | 51.0% | 37.5% | Database |
| Sort an Array | Medium | 55.9% | 37.5% | ArrayDivide and ConquerSorting+5 |
| Edit Distance | Medium | 60.1% | 37.5% | StringDynamic Programming |
| Find All Duplicates in an Array | Medium | 76.8% | 37.5% | ArrayHash TableSorting |
| N-Queens II | Hard | 78.1% | 37.5% | Backtracking |
| Relative Sort Array | Easy | 75.1% | 37.5% | ArrayHash TableSorting+1 |
| Number of Distinct Islands | Medium | 62.7% | 37.5% | |
| Perfect Squares | Medium | 56.3% | 37.5% | MathDynamic ProgrammingBreadth-First Search |
| Find All Anagrams in a String | Medium | 53.3% | 37.5% | Hash TableStringSliding Window |
| Longest Substring with At Least K Repeating Characters | Medium | 46.0% | 37.5% | Hash TableStringDivide and Conquer+1 |
| Linked List Cycle | Easy | 53.9% | 37.5% | Hash TableLinked ListTwo Pointers |
| Meeting Rooms III | Hard | 51.7% | 37.5% | ArrayHash TableSorting+2 |
| Binary Tree Level Order Traversal | Medium | 72.2% | 37.5% | TreeBreadth-First SearchBinary Tree |
| Reconstruct Itinerary | Hard | 44.3% | 37.5% | ArrayStringDepth-First Search+4 |
| Candy | Hard | 47.9% | 37.5% | ArrayGreedy |
| Top K Frequent Words | Medium | 60.0% | 37.5% | ArrayHash TableString+5 |
| Binary Tree Maximum Path Sum | Hard | 42.0% | 37.5% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Decode String | Medium | 62.2% | 37.5% | StringStackRecursion |
| Nearest Exit from Entrance in Maze | Medium | 48.3% | 37.5% | ArrayBreadth-First SearchMatrix |
| Furthest Building You Can Reach | Medium | 50.7% | 37.5% | ArrayGreedyHeap (Priority Queue) |
| Remove Duplicates from Sorted Array | Easy | 62.2% | 37.5% | ArrayTwo Pointers |