| ID | Title | Difficulty | Likes | AC Rate | Tags |
|---|---|---|---|---|---|
| 1 | Two Sum | Easy | 54609 | 51.6% | Array; Hash Table; |
| 3 | Longest Substring Without Repeating Characters | Medium | 38530 | 34.4% | Hash Table; String; Sliding Window; |
| 53 | Maximum Subarray | Medium | 33051 | 50.5% | Array; Divide and Conquer; Dynamic Programming; |
| 42 | Trapping Rain Water | Hard | 30410 | 60.5% | Array; Two Pointers; Dynamic Programming; Stack; Monotonic Stack; |
| 121 | Best Time to Buy and Sell Stock | Easy | 29779 | 53.5% | Array; Dynamic Programming; |
| 2 | Add Two Numbers | Medium | 29758 | 42.1% | Linked List; Math; Recursion; |
| 15 | 3Sum | Medium | 29705 | 34.0% | Array; Two Pointers; Sorting; |
| 5 | Longest Palindromic Substring | Medium | 28480 | 33.5% | String; Dynamic Programming; |
| 11 | Container With Most Water | Medium | 27954 | 54.7% | Array; Two Pointers; Greedy; |
| 4 | Median of Two Sorted Arrays | Hard | 27368 | 39.1% | Array; Binary Search; Divide and Conquer; |
| 33 | Search in Rotated Sorted Array | Medium | 25307 | 40.3% | Array; Binary Search; |
| 20 | Valid Parentheses | Easy | 23162 | 40.4% | String; Stack; |
| 287 | Find the Duplicate Number | Medium | 22203 | 59.4% | Array; Two Pointers; Binary Search; Bit Manipulation; |
| 200 | Number of Islands | Medium | 21849 | 58.4% | Array; Depth-First Search; Breadth-First Search; Union Find; Matrix; |
| 56 | Merge Intervals | Medium | 21512 | 46.9% | Array; Sorting; |
| 70 | Climbing Stairs | Easy | 21217 | 52.8% | Math; Dynamic Programming; Memoization; |
| 238 | Product of Array Except Self | Medium | 21211 | 65.2% | Array; Prefix Sum; |
| 21 | Merge Two Sorted Lists | Easy | 20954 | 63.8% | Linked List; Recursion; |
| 560 | Subarray Sum Equals K | Medium | 20635 | 43.3% | Array; Hash Table; Prefix Sum; |
| 206 | Reverse Linked List | Easy | 20499 | 75.5% | Linked List; Recursion; |
| 198 | House Robber | Medium | 20386 | 50.7% | Array; Dynamic Programming; |
| 22 | Generate Parentheses | Medium | 20367 | 74.0% | String; Dynamic Programming; Backtracking; |
| 300 | Longest Increasing Subsequence | Medium | 20301 | 54.8% | Array; Binary Search; Dynamic Programming; |
| 146 | LRU Cache | Medium | 19982 | 42.0% | Hash Table; Linked List; Design; Doubly-Linked List; |
| 34 | Find First and Last Position of Element in Sorted Array | Medium | 19855 | 43.8% | Array; Binary Search; |
| 128 | Longest Consecutive Sequence | Medium | 19166 | 47.3% | Array; Hash Table; Union Find; |
| 23 | Merge k Sorted Lists | Hard | 18894 | 51.9% | Linked List; Divide and Conquer; Heap (Priority Queue); Merge Sort; |
| 55 | Jump Game | Medium | 18599 | 38.5% | Array; Dynamic Programming; Greedy; |
| 46 | Permutations | Medium | 18491 | 77.8% | Array; Backtracking; |
| 322 | Coin Change | Medium | 18325 | 43.4% | Array; Dynamic Programming; Breadth-First Search; |
| 39 | Combination Sum | Medium | 18206 | 70.7% | Array; Backtracking; |
| 49 | Group Anagrams | Medium | 18076 | 67.5% | Array; Hash Table; String; Sorting; |
| 169 | Majority Element | Easy | 17994 | 63.9% | Array; Hash Table; Divide and Conquer; Sorting; Counting; |
| 152 | Maximum Product Subarray | Medium | 17911 | 34.9% | Array; Dynamic Programming; |
| 17 | Letter Combinations of a Phone Number | Medium | 17870 | 59.7% | Hash Table; String; Backtracking; |
| 19 | Remove Nth Node From End of List | Medium | 17855 | 43.6% | Linked List; Two Pointers; |
| 31 | Next Permutation | Medium | 17649 | 39.2% | Array; Two Pointers; |
| 239 | Sliding Window Maximum | Hard | 17631 | 46.5% | Array; Queue; Sliding Window; Heap (Priority Queue); Monotonic Queue; |
| 75 | Sort Colors | Medium | 17409 | 61.4% | Array; Two Pointers; Sorting; |
| 189 | Rotate Array | Medium | 17154 | 40.2% | Array; Math; Two Pointers; |
| 48 | Rotate Image | Medium | 16907 | 73.5% | Array; Math; Matrix; |
| 76 | Minimum Window Substring | Hard | 16808 | 41.7% | Hash Table; String; Sliding Window; |
| 14 | Longest Common Prefix | Easy | 16763 | 42.2% | String; Trie; |
| 139 | Word Break | Medium | 16714 | 46.5% | Array; Hash Table; String; Dynamic Programming; Trie; Memoization; |
| 347 | Top K Frequent Elements | Medium | 16680 | 62.7% | Array; Hash Table; Divide and Conquer; Sorting; Heap (Priority Queue); Bucket Sort; Counting; Quickselect; |
| 215 | Kth Largest Element in an Array | Medium | 16547 | 66.8% | Array; Divide and Conquer; Sorting; Heap (Priority Queue); Quickselect; |
| 84 | Largest Rectangle in Histogram | Hard | 16522 | 43.9% | Array; Stack; Monotonic Stack; |
| 78 | Subsets | Medium | 16414 | 76.9% | Array; Backtracking; Bit Manipulation; |
| 98 | Validate Binary Search Tree | Medium | 16325 | 32.6% | Tree; Depth-First Search; Binary Search Tree; Binary Tree; |
| 62 | Unique Paths | Medium | 16134 | 64.0% | Math; Dynamic Programming; Combinatorics; |
| 124 | Binary Tree Maximum Path Sum | Hard | 16101 | 39.8% | Dynamic Programming; Tree; Depth-First Search; Binary Tree; |
| 283 | Move Zeroes | Easy | 16044 | 61.5% | Array; Two Pointers; |
| 136 | Single Number | Easy | 15916 | 72.2% | Array; Bit Manipulation; |
| 236 | Lowest Common Ancestor of a Binary Tree | Medium | 15890 | 61.3% | Tree; Depth-First Search; Binary Tree; |
| 234 | Palindrome Linked List | Easy | 15693 | 51.5% | Linked List; Two Pointers; Stack; Recursion; |
| 207 | Course Schedule | Medium | 15690 | 46.5% | Depth-First Search; Breadth-First Search; Graph; Topological Sort; |
| 41 | First Missing Positive | Hard | 15651 | 37.6% | Array; Hash Table; |
| 35 | Search Insert Position | Easy | 15496 | 45.2% | Array; Binary Search; |
| 74 | Search a 2D Matrix | Medium | 15166 | 49.6% | Array; Binary Search; Matrix; |
| 79 | Word Search | Medium | 14871 | 41.2% | Array; Backtracking; Matrix; |
| 102 | Binary Tree Level Order Traversal | Medium | 14840 | 66.5% | Tree; Breadth-First Search; Binary Tree; |
| 101 | Symmetric Tree | Easy | 14829 | 55.9% | Tree; Depth-First Search; Breadth-First Search; Binary Tree; |
| 141 | Linked List Cycle | Easy | 14704 | 49.3% | Hash Table; Linked List; Two Pointers; |
| 160 | Intersection of Two Linked Lists | Easy | 14474 | 56.7% | Hash Table; Linked List; Two Pointers; |
| 105 | Construct Binary Tree from Preorder and Inorder Traversal | Medium | 14459 | 63.3% | Array; Hash Table; Divide and Conquer; Tree; Binary Tree; |
| 72 | Edit Distance | Medium | 14331 | 55.9% | String; Dynamic Programming; |
| 54 | Spiral Matrix | Medium | 14125 | 48.6% | Array; Matrix; Simulation; |
| 45 | Jump Game II | Medium | 13999 | 40.3% | Array; Dynamic Programming; Greedy; |
| 73 | Set Matrix Zeroes | Medium | 13827 | 54.6% | Array; Hash Table; Matrix; |
| 88 | Merge Sorted Array | Easy | 13795 | 48.8% | Array; Two Pointers; Sorting; |
| 26 | Remove Duplicates from Sorted Array | Easy | 13611 | 54.5% | Array; Two Pointers; |
| 226 | Invert Binary Tree | Easy | 13581 | 76.4% | Tree; Depth-First Search; Breadth-First Search; Binary Tree; |
| 155 | Min Stack | Medium | 13571 | 53.6% | Stack; Design; |
| 138 | Copy List with Random Pointer | Medium | 13393 | 55.2% | Hash Table; Linked List; |
| 13 | Roman to Integer | Easy | 13324 | 60.4% | Hash Table; Math; String; |
| 25 | Reverse Nodes in k-Group | Hard | 13131 | 57.7% | Linked List; Recursion; |
| 142 | Linked List Cycle II | Medium | 13101 | 50.6% | Hash Table; Linked List; Two Pointers; |
| 94 | Binary Tree Inorder Traversal | Easy | 13079 | 75.7% | Stack; Tree; Depth-First Search; Binary Tree; |
| 1250 | Longest Common Subsequence | Medium | 13077 | 57.9% | String; Dynamic Programming; |
| 122 | Best Time to Buy and Sell Stock II | Medium | 13043 | 65.8% | Array; Dynamic Programming; Greedy; |
| 543 | Diameter of Binary Tree | Easy | 12993 | 58.7% | Tree; Depth-First Search; Binary Tree; |
| 153 | Find Minimum in Rotated Sorted Array | Medium | 12633 | 49.9% | Array; Binary Search; |
| 7 | Reverse Integer | Medium | 12440 | 28.3% | Math; |
| 118 | Pascal's Triangle | Easy | 12374 | 73.7% | Array; Dynamic Programming; |
| 104 | Maximum Depth of Binary Tree | Easy | 12370 | 74.9% | Tree; Depth-First Search; Breadth-First Search; Binary Tree; |
| 394 | Decode String | Medium | 12248 | 58.9% | String; Stack; Recursion; |
| 1036 | Rotting Oranges | Medium | 12212 | 53.8% | Array; Breadth-First Search; Matrix; |
| 209 | Minimum Size Subarray Sum | Medium | 12159 | 46.7% | Array; Binary Search; Sliding Window; Prefix Sum; |
| 739 | Daily Temperatures | Medium | 12152 | 65.9% | Array; Stack; Monotonic Stack; |
| 131 | Palindrome Partitioning | Medium | 12122 | 66.9% | String; Dynamic Programming; Backtracking; |
| 64 | Minimum Path Sum | Medium | 12072 | 63.4% | Array; Dynamic Programming; Matrix; |
| 438 | Find All Anagrams in a String | Medium | 12060 | 50.7% | Hash Table; String; Sliding Window; |
| 32 | Longest Valid Parentheses | Hard | 12045 | 33.6% | String; Dynamic Programming; Stack; |
| 9 | Palindrome Number | Easy | 11949 | 55.4% | Math; |
| 51 | N-Queens | Hard | 11863 | 67.3% | Array; Backtracking; |
| 416 | Partition Equal Subset Sum | Medium | 11862 | 46.2% | Array; Dynamic Programming; |
| 114 | Flatten Binary Tree to Linked List | Medium | 11836 | 64.2% | Linked List; Stack; Tree; Depth-First Search; Binary Tree; |
| 10 | Regular Expression Matching | Hard | 11794 | 28.1% | String; Dynamic Programming; Recursion; |
| 127 | Word Ladder | Hard | 11659 | 38.6% | Hash Table; String; Breadth-First Search; |
| 242 | Valid Anagram | Easy | 11612 | 64.1% | Hash Table; String; Sorting; |
Comments (0)