| Two Sum | Easy | 57.1% | 100.0% | ArrayHash Table |
| Merge Sorted Array | Easy | 54.4% | 83.7% | ArrayTwo PointersSorting |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 79.4% | Hash TableStringSliding Window |
| Add Two Numbers | Medium | 48.0% | 78.3% | Linked ListMathRecursion |
| Longest Palindromic Substring | Medium | 37.4% | 75.8% | Two PointersStringDynamic Programming |
| Trapping Rain Water | Hard | 66.8% | 75.7% | ArrayTwo PointersDynamic Programming+2 |
| Single Element in a Sorted Array | Medium | 59.2% | 73.8% | ArrayBinary Search |
| Merge Intervals | Medium | 51.2% | 73.8% | ArraySorting |
| Median of Two Sorted Arrays | Hard | 46.0% | 72.9% | ArrayBinary SearchDivide and Conquer |
| Valid Parentheses | Easy | 43.7% | 72.9% | StringStack |
| 3Sum | Medium | 38.6% | 72.9% | ArrayTwo PointersSorting |
| Maximum Subarray | Medium | 53.0% | 72.9% | ArrayDivide and ConquerDynamic Programming |
| Group Anagrams | Medium | 72.2% | 69.8% | ArrayHash TableString+1 |
| Search in Rotated Sorted Array | Medium | 44.1% | 68.5% | ArrayBinary Search |
| Reverse Nodes in k-Group | Hard | 65.4% | 68.5% | Linked ListRecursion |
| Merge Two Sorted Lists | Easy | 68.0% | 68.5% | Linked ListRecursion |
| Roman to Integer | Easy | 66.3% | 68.3% | Hash TableMathString |
| Spiral Matrix | Medium | 56.2% | 68.3% | ArrayMatrixSimulation |
| Climbing Stairs | Easy | 53.9% | 68.0% | MathDynamic ProgrammingMemoization |
| Container With Most Water | Medium | 59.6% | 67.7% | ArrayTwo PointersGreedy |
| Rotate Image | Medium | 79.4% | 67.7% | ArrayMathMatrix |
| Palindrome Number | Easy | 60.3% | 67.5% | Math |
| Merge k Sorted Lists | Hard | 58.9% | 67.5% | Linked ListDivide and ConquerHeap (Priority Queue)+1 |
| Sort Colors | Medium | 69.2% | 65.8% | ArrayTwo PointersSorting |
| Longest Common Prefix | Easy | 47.1% | 65.8% | StringTrie |
| Remove Duplicates from Sorted Array | Easy | 62.3% | 64.5% | ArrayTwo Pointers |
| Create Hello World Function | Easy | 82.0% | 64.4% | |
| Set Matrix Zeroes | Medium | 62.5% | 62.9% | ArrayHash TableMatrix |
| Reverse Integer | Medium | 31.5% | 62.5% | Math |
| Letter Combinations of a Phone Number | Medium | 65.5% | 62.5% | Hash TableStringBacktracking |
| Number of Islands | Medium | 63.8% | 61.9% | ArrayDepth-First SearchBreadth-First Search+2 |
| Word Search | Medium | 46.9% | 60.6% | ArrayStringBacktracking+2 |
| Generate Parentheses | Medium | 78.3% | 60.2% | StringDynamic ProgrammingBacktracking |
| Minimum Edge Reversals So Every Node Is Reachable | Hard | 57.3% | 59.7% | Dynamic ProgrammingDepth-First SearchBreadth-First Search+1 |
| Find Peak Element | Medium | 46.8% | 59.7% | ArrayBinary Search |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 59.7% | ArrayDynamic Programming |
| Move Zeroes | Easy | 63.6% | 59.7% | ArrayTwo Pointers |
| K-th Smallest in Lexicographical Order | Hard | 46.2% | 59.7% | Trie |
| Max Consecutive Ones | Easy | 64.6% | 59.7% | Array |
| Minimum Size Subarray Sum | Medium | 51.1% | 59.7% | ArrayBinary SearchSliding Window+1 |
| Jump Game | Medium | 40.5% | 59.4% | ArrayDynamic ProgrammingGreedy |
| Next Permutation | Medium | 44.8% | 59.0% | ArrayTwo Pointers |
| Recyclable and Low Fat Products | Easy | 88.7% | 59.0% | Database |
| Remove Element | Easy | 61.4% | 58.1% | ArrayTwo Pointers |
| Minimum Path Sum | Medium | 67.8% | 58.1% | ArrayDynamic ProgrammingMatrix |
| Binary Tree Zigzag Level Order Traversal | Medium | 63.2% | 57.6% | TreeBreadth-First SearchBinary Tree |
| Rotate Array | Medium | 44.5% | 55.8% | ArrayMathTwo Pointers |
| String to Integer (atoi) | Medium | 20.6% | 55.6% | String |
| Validate Binary Search Tree | Medium | 35.4% | 55.6% | TreeDepth-First SearchBinary Search Tree+1 |
| Largest Rectangle in Histogram | Hard | 49.4% | 54.6% | ArrayStackMonotonic Stack |
| Find First and Last Position of Element in Sorted Array | Medium | 48.4% | 54.6% | ArrayBinary Search |
| Combination Sum | Medium | 76.1% | 54.6% | ArrayBacktracking |
| Find the Index of the First Occurrence in a String | Easy | 46.3% | 54.6% | Two PointersStringString Matching |
| First Missing Positive | Hard | 42.5% | 54.6% | ArrayHash Table |
| Jump Game II | Medium | 42.5% | 54.0% | ArrayDynamic ProgrammingGreedy |
| Permutations | Medium | 81.7% | 54.0% | ArrayBacktracking |
| Unique Paths | Medium | 66.6% | 52.8% | MathDynamic ProgrammingCombinatorics |
| Swap Nodes in Pairs | Medium | 69.0% | 52.8% | Linked ListRecursion |
| Reverse Words in a String | Medium | 55.6% | 52.4% | Two PointersString |
| Search Insert Position | Easy | 50.7% | 52.2% | ArrayBinary Search |
| Pow(x, n) | Medium | 38.3% | 52.2% | MathRecursion |
| Integer to Roman | Medium | 70.5% | 52.2% | Hash TableMathString |
| Subsets | Medium | 82.1% | 52.2% | ArrayBacktrackingBit Manipulation |
| 4Sum | Medium | 40.0% | 52.2% | ArrayTwo PointersSorting |
| Single Number | Easy | 77.4% | 51.9% | ArrayBit Manipulation |
| Happy Number | Easy | 59.3% | 51.9% | Hash TableMathTwo Pointers |
| Merge Strings Alternately | Easy | 82.1% | 51.9% | Two PointersString |
| Regular Expression Matching | Hard | 30.5% | 51.6% | StringDynamic ProgrammingRecursion |
| Binary Tree Level Order Traversal | Medium | 72.2% | 50.9% | TreeBreadth-First SearchBinary Tree |
| Search a 2D Matrix | Medium | 53.6% | 50.9% | ArrayBinary SearchMatrix |
| N-Queens | Hard | 75.0% | 50.9% | ArrayBacktracking |
| Gas Station | Medium | 47.5% | 50.3% | ArrayGreedy |
| Split Array Largest Sum | Hard | 59.9% | 50.3% | ArrayBinary SearchDynamic Programming+2 |
| Subarray Sum Equals K | Medium | 46.8% | 50.3% | ArrayHash TablePrefix Sum |
| Contains Duplicate | Easy | 64.1% | 50.3% | ArrayHash TableSorting |
| Minimum Operations to Reduce an Integer to 0 | Medium | 61.1% | 50.3% | Dynamic ProgrammingGreedyBit Manipulation |
| Frequency of the Most Frequent Element | Medium | 44.6% | 50.3% | ArrayBinary SearchGreedy+3 |
| Intersection of Two Linked Lists | Easy | 63.2% | 50.3% | Hash TableLinked ListTwo Pointers |
| Sliding Window Maximum | Hard | 48.5% | 50.3% | ArrayQueueSliding Window+2 |
| Find Minimum in Rotated Sorted Array | Medium | 53.8% | 50.3% | ArrayBinary Search |
| Longest Substring with At Most K Distinct Characters | Medium | 49.9% | 50.3% | Hash TableStringSliding Window |
| Longest Consecutive Sequence | Medium | 47.0% | 50.3% | ArrayHash TableUnion Find |
| Zero Array Transformation III | Medium | 54.9% | 50.3% | ArrayGreedySorting+2 |
| Maximum Difference Between Even and Odd Frequency II | Hard | 48.7% | 50.3% | StringSliding WindowEnumeration+1 |
| Next Greater Element I | Easy | 75.8% | 50.3% | ArrayHash TableStack+1 |
| Add Strings | Easy | 52.1% | 50.3% | MathStringSimulation |
| Maximum Difference Between Even and Odd Frequency I | Easy | 60.7% | 50.3% | Hash TableStringCounting |
| Transform Array to All Equal Elements | Medium | 33.0% | 50.3% | ArrayGreedy |
| LRU Cache | Medium | 46.8% | 50.3% | Hash TableLinked ListDesign+1 |
| Valid Sudoku | Medium | 64.2% | 50.2% | ArrayHash TableMatrix |
| Edit Distance | Medium | 60.2% | 49.5% | StringDynamic Programming |
| Remove Nth Node From End of List | Medium | 51.0% | 49.5% | Linked ListTwo Pointers |
| Binary Tree Inorder Traversal | Easy | 79.7% | 49.5% | StackTreeDepth-First Search+1 |
| Divide Two Integers | Medium | 19.4% | 49.5% | MathBit Manipulation |
| Simplify Path | Medium | 50.0% | 49.5% | StringStack |
| Sudoku Solver | Hard | 65.4% | 48.8% | ArrayHash TableBacktracking+1 |
| Restore IP Addresses | Medium | 55.3% | 48.8% | StringBacktracking |
| Construct Binary Tree from Preorder and Inorder Traversal | Medium | 68.4% | 47.7% | ArrayHash TableDivide and Conquer+2 |
| Intersection of Two Arrays | Easy | 77.5% | 47.2% | ArrayHash TableTwo Pointers+2 |
| Koko Eating Bananas | Medium | 49.7% | 47.2% | ArrayBinary Search |
| Memoize | Medium | 64.8% | 47.2% | |
| Palindrome Linked List | Easy | 57.5% | 47.2% | Linked ListTwo PointersStack+1 |
| Basic Calculator | Hard | 46.6% | 47.2% | MathStringStack+1 |
| Serialize and Deserialize Binary Tree | Hard | 60.4% | 47.2% | StringTreeDepth-First Search+3 |
| Word Ladder | Hard | 44.9% | 47.2% | Hash TableStringBreadth-First Search |
| Reverse Linked List | Easy | 80.3% | 47.2% | Linked ListRecursion |
| Candy | Hard | 48.0% | 47.2% | ArrayGreedy |
| Longest Valid Parentheses | Hard | 38.1% | 47.2% | StringDynamic ProgrammingStack |
| Decode Ways | Medium | 37.6% | 45.5% | StringDynamic Programming |
| Maximal Rectangle | Hard | 58.1% | 44.5% | ArrayDynamic ProgrammingStack+2 |
| Sqrt(x) | Easy | 41.4% | 44.5% | MathBinary Search |
| Course Schedule II | Medium | 55.0% | 44.1% | Depth-First SearchBreadth-First SearchGraph+1 |
| Meeting Rooms II | Medium | 52.6% | 44.1% | ArrayTwo PointersGreedy+3 |
| Zigzag Conversion | Medium | 53.6% | 43.6% | String |
| Reverse Linked List II | Medium | 51.0% | 43.6% | Linked List |
| Permutations II | Medium | 63.0% | 43.6% | ArrayBacktrackingSorting |
| Plus One | Easy | 49.6% | 42.5% | ArrayMath |
| Symmetric Tree | Easy | 60.8% | 42.5% | TreeDepth-First SearchBreadth-First Search+1 |
| Minimum Window Substring | Hard | 47.0% | 41.4% | Hash TableStringSliding Window |
| Add Binary | Easy | 57.7% | 41.4% | MathStringBit Manipulation+1 |
| Design Tic-Tac-Toe | Medium | 58.7% | 41.2% | ArrayHash TableDesign+2 |
| House Robber | Medium | 52.9% | 41.2% | ArrayDynamic Programming |
| Majority Element | Easy | 66.1% | 41.2% | ArrayHash TableDivide and Conquer+2 |
| Product of Array Except Self | Medium | 68.6% | 41.2% | ArrayPrefix Sum |
| Big Countries | Easy | 68.4% | 41.2% | Database |
| Online Stock Span | Medium | 68.7% | 41.2% | StackDesignMonotonic Stack+1 |
| Kth Largest Element in an Array | Medium | 68.8% | 41.2% | ArrayDivide and ConquerSorting+2 |
| Course Schedule | Medium | 50.8% | 41.2% | Depth-First SearchBreadth-First SearchGraph+1 |
| Assign Cookies | Easy | 54.7% | 41.2% | ArrayTwo PointersGreedy+1 |
| Word Break | Medium | 49.1% | 41.2% | ArrayHash TableString+3 |
| Ransom Note | Easy | 65.7% | 41.2% | Hash TableStringCounting |
| Rotting Oranges | Medium | 58.2% | 40.4% | ArrayBreadth-First SearchMatrix |
| Search in Rotated Sorted Array II | Medium | 39.8% | 39.0% | ArrayBinary Search |
| Wildcard Matching | Hard | 31.4% | 39.0% | StringDynamic ProgrammingGreedy+1 |
| Remove Duplicates from Sorted List | Easy | 56.3% | 39.0% | Linked List |
| Combination Sum II | Medium | 59.0% | 37.7% | ArrayBacktracking |
| Multiply Strings | Medium | 43.6% | 37.7% | MathStringSimulation |
| Text Justification | Hard | 50.5% | 37.7% | ArrayStringSimulation |
| Insert Interval | Medium | 44.8% | 37.7% | Array |
| Remove Duplicates from Sorted Array II | Medium | 64.3% | 37.7% | ArrayTwo Pointers |
| Length of Last Word | Easy | 58.3% | 37.7% | String |
| Spiral Matrix II | Medium | 74.7% | 37.7% | ArrayMatrixSimulation |
| Convert Sorted Array to Binary Search Tree | Easy | 75.2% | 36.9% | ArrayDivide and ConquerTree+2 |
| Recover Binary Search Tree | Medium | 58.8% | 36.2% | TreeDepth-First SearchBinary Search Tree+1 |
| Maximum Depth of Binary Tree | Easy | 77.9% | 36.2% | TreeDepth-First SearchBreadth-First Search+1 |
| Rotate List | Medium | 41.2% | 36.2% | Linked ListTwo Pointers |
| Same Tree | Easy | 66.7% | 36.2% | TreeDepth-First SearchBreadth-First Search+1 |
| Subsets II | Medium | 60.9% | 36.2% | ArrayBacktrackingBit Manipulation |
| Interleaving String | Medium | 43.5% | 36.2% | StringDynamic Programming |
| Encode and Decode Strings | Medium | 51.2% | 36.0% | ArrayStringDesign |
| Valid Anagram | Easy | 67.8% | 36.0% | Hash TableStringSorting |
| Lowest Common Ancestor of a Binary Tree | Medium | 68.8% | 36.0% | TreeDepth-First SearchBinary Tree |
| Isomorphic Strings | Easy | 48.1% | 36.0% | Hash TableString |
| Find Median from Data Stream | Hard | 54.2% | 36.0% | Two PointersDesignSorting+2 |
| Best Time to Buy and Sell Stock III | Hard | 53.2% | 36.0% | ArrayDynamic Programming |
| Remove Duplicates from Sorted List II | Medium | 51.3% | 34.7% | Linked ListTwo Pointers |
| Search a 2D Matrix II | Medium | 56.9% | 32.8% | ArrayBinary SearchDivide and Conquer+1 |
| Partition Equal Subset Sum | Medium | 49.2% | 32.8% | ArrayDynamic Programming |
| Min Stack | Medium | 57.7% | 32.8% | StackDesign |
| Increasing Triplet Subsequence | Medium | 39.2% | 32.8% | ArrayGreedy |
| Combine Two Tables | Easy | 79.2% | 32.8% | Database |
| Add Two Integers | Easy | 87.9% | 32.8% | Math |
| Implement Stack using Queues | Easy | 69.4% | 32.8% | StackDesignQueue |
| Sum of All Subset XOR Totals | Easy | 90.1% | 32.8% | ArrayMathBacktracking+3 |
| Single-Threaded CPU | Medium | 47.4% | 32.8% | ArraySortingHeap (Priority Queue) |
| Maximum Value of an Ordered Triplet II | Medium | 56.4% | 32.8% | Array |
| Can Place Flowers | Easy | 29.1% | 32.8% | ArrayGreedy |
| Set Mismatch | Easy | 44.2% | 32.8% | ArrayHash TableBit Manipulation+1 |
| Contains Duplicate II | Easy | 50.8% | 32.8% | ArrayHash TableSliding Window |
| Is Subsequence | Easy | 48.9% | 32.8% | Two PointersStringDynamic Programming |
| Daily Temperatures | Medium | 68.4% | 32.8% | ArrayStackMonotonic Stack |
| Lowest Common Ancestor of a Binary Search Tree | Medium | 70.1% | 32.8% | TreeDepth-First SearchBinary Search Tree+1 |
| Construct Binary Tree from Inorder and Postorder Traversal | Medium | 68.1% | 32.8% | ArrayHash TableDivide and Conquer+2 |
| Combinations | Medium | 74.2% | 31.1% | Backtracking |
| Count and Say | Medium | 62.3% | 31.1% | String |
| 3Sum Closest | Medium | 48.1% | 31.1% | ArrayTwo PointersSorting |
| Binary Tree Maximum Path Sum | Hard | 42.0% | 30.3% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Copy List with Random Pointer | Medium | 62.4% | 30.3% | Hash TableLinked List |
| Max Consecutive Ones III | Medium | 67.3% | 30.3% | ArrayBinary SearchSliding Window+1 |
| Evaluate Reverse Polish Notation | Medium | 57.1% | 30.3% | ArrayMathStack |
| Linked List Cycle | Easy | 53.9% | 30.3% | Hash TableLinked ListTwo Pointers |
| Substring with Concatenation of All Words | Hard | 34.0% | 26.7% | Hash TableStringSliding Window |
| Convert Sorted List to Binary Search Tree | Medium | 66.0% | 24.5% | Linked ListDivide and ConquerTree+2 |
| Partition List | Medium | 60.6% | 24.1% | Linked ListTwo Pointers |
| Unique Paths II | Medium | 44.2% | 24.1% | ArrayDynamic ProgrammingMatrix |
| Article Views I | Easy | 76.7% | 22.6% | Database |
| Missing Number | Easy | 71.7% | 22.6% | ArrayHash TableMath+3 |
| Two Sum II - Input Array Is Sorted | Medium | 64.6% | 22.6% | ArrayTwo PointersBinary Search |
| Best Time to Buy and Sell Stock II | Medium | 70.8% | 22.6% | ArrayDynamic ProgrammingGreedy |
| Unique Binary Search Trees | Medium | 63.3% | 21.0% | MathDynamic ProgrammingTree+2 |
| N-Queens II | Hard | 78.2% | 21.0% | Backtracking |
| Unique Binary Search Trees II | Medium | 62.0% | 13.2% | Dynamic ProgrammingBacktrackingTree+2 |
