| ID | Title | Difficulty | Likes | AC Rate | Tags |
|---|---|---|---|---|---|
| 24 | Swap Nodes in Pairs | Medium | 11602 | 63.7% | Linked List; Recursion; |
| 91 | Decode Ways | Medium | 11591 | 34.5% | String; Dynamic Programming; |
| 240 | Search a 2D Matrix II | Medium | 11566 | 52.2% | Array; Binary Search; Divide and Conquer; Matrix; |
| 199 | Binary Tree Right Side View | Medium | 11543 | 62.7% | Tree; Depth-First Search; Breadth-First Search; Binary Tree; |
| 295 | Find Median from Data Stream | Hard | 11500 | 51.7% | Two Pointers; Design; Sorting; Heap (Priority Queue); Data Stream; |
| 134 | Gas Station | Medium | 11467 | 45.6% | Array; Greedy; |
| 217 | Contains Duplicate | Easy | 11450 | 61.3% | Array; Hash Table; Sorting; |
| 792 | Binary Search | Easy | 11379 | 57.1% | Array; Binary Search; |
| 162 | Find Peak Element | Medium | 11310 | 45.8% | Array; Binary Search; |
| 167 | Two Sum II - Input Array Is Sorted | Medium | 11280 | 60.8% | Array; Two Pointers; Binary Search; |
| 268 | Missing Number | Easy | 11252 | 64.9% | Array; Hash Table; Math; Binary Search; Bit Manipulation; Sorting; |
| 92 | Reverse Linked List II | Medium | 11207 | 47.4% | Linked List; |
| 208 | Implement Trie (Prefix Tree) | Medium | 11191 | 64.5% | Hash Table; String; Design; Trie; |
| 148 | Sort List | Medium | 11146 | 57.1% | Linked List; Two Pointers; Divide and Conquer; Sorting; Merge Sort; |
| 747 | Min Cost Climbing Stairs | Easy | 11097 | 65.4% | Array; Dynamic Programming; |
| 230 | Kth Smallest Element in a BST | Medium | 11070 | 71.9% | Tree; Depth-First Search; Binary Search Tree; Binary Tree; |
| 567 | Permutation in String | Medium | 10988 | 44.2% | Hash Table; Two Pointers; String; Sliding Window; |
| 908 | Middle of the Linked List | Easy | 10933 | 77.1% | Linked List; Two Pointers; |
| 18 | 4Sum | Medium | 10899 | 36.0% | Array; Two Pointers; Sorting; |
| 100 | Same Tree | Easy | 10893 | 60.5% | Tree; Depth-First Search; Breadth-First Search; Binary Tree; |
| 338 | Counting Bits | Easy | 10799 | 77.9% | Dynamic Programming; Bit Manipulation; |
| 540 | Single Element in a Sorted Array | Medium | 10722 | 59.0% | Array; Binary Search; |
| 235 | Lowest Common Ancestor of a Binary Search Tree | Medium | 10699 | 64.0% | Tree; Depth-First Search; Binary Search Tree; Binary Tree; |
| 108 | Convert Sorted Array to Binary Search Tree | Easy | 10649 | 71.2% | Array; Divide and Conquer; Tree; Binary Search Tree; Binary Tree; |
| 893 | All Nodes Distance K in Binary Tree | Medium | 10647 | 64.2% | Tree; Depth-First Search; Breadth-First Search; Binary Tree; |
| 437 | Path Sum III | Medium | 10602 | 46.7% | Tree; Depth-First Search; Binary Tree; |
| 494 | Target Sum | Medium | 10535 | 46.4% | Array; Dynamic Programming; Backtracking; |
| 103 | Binary Tree Zigzag Level Order Traversal | Medium | 10447 | 58.4% | Tree; Breadth-First Search; Binary Tree; |
| 210 | Course Schedule II | Medium | 10395 | 49.9% | Depth-First Search; Breadth-First Search; Graph; Topological Sort; |
| 279 | Perfect Squares | Medium | 10323 | 53.1% | Math; Dynamic Programming; Breadth-First Search; |
| 110 | Balanced Binary Tree | Easy | 10310 | 51.3% | Tree; Depth-First Search; Binary Tree; |
| 36 | Valid Sudoku | Medium | 10239 | 59.2% | Array; Hash Table; Matrix; |
| 16 | 3Sum Closest | Medium | 10183 | 45.6% | Array; Two Pointers; Sorting; |
| 96 | Unique Binary Search Trees | Medium | 10142 | 60.7% | Math; Dynamic Programming; Tree; Binary Search Tree; Binary Tree; |
| 143 | Reorder List | Medium | 10121 | 55.6% | Linked List; Two Pointers; Stack; Recursion; |
| 768 | Partition Labels | Medium | 10103 | 79.8% | Hash Table; Two Pointers; String; Greedy; |
| 40 | Combination Sum II | Medium | 10074 | 54.1% | Array; Backtracking; |
| 424 | Longest Repeating Character Replacement | Medium | 10032 | 53.3% | Hash Table; String; Sliding Window; |
| 647 | Palindromic Substrings | Medium | 9923 | 68.3% | String; Dynamic Programming; |
| 202 | Happy Number | Easy | 9913 | 55.8% | Hash Table; Math; Two Pointers; |
| 297 | Serialize and Deserialize Binary Tree | Hard | 9831 | 56.4% | String; Tree; Depth-First Search; Breadth-First Search; Design; Binary Tree; |
| 221 | Maximal Square | Medium | 9822 | 46.1% | Array; Dynamic Programming; Matrix; |
| 907 | Koko Eating Bananas | Medium | 9819 | 49.2% | Array; Binary Search; |
| 695 | Max Area of Island | Medium | 9731 | 71.8% | Array; Depth-First Search; Breadth-First Search; Union Find; Matrix; |
| 378 | Kth Smallest Element in a Sorted Matrix | Medium | 9678 | 62.2% | Array; Binary Search; Sorting; Heap (Priority Queue); Matrix; |
| 85 | Maximal Rectangle | Hard | 9651 | 46.5% | Array; Dynamic Programming; Stack; Matrix; Monotonic Stack; |
| 328 | Odd Even Linked List | Medium | 9526 | 61.4% | Linked List; |
| 213 | House Robber II | Medium | 9489 | 41.8% | Array; Dynamic Programming; |
| 442 | Find All Duplicates in an Array | Medium | 9487 | 73.6% | Array; Hash Table; |
| 116 | Populating Next Right Pointers in Each Node | Medium | 9446 | 62.1% | Linked List; Tree; Depth-First Search; Breadth-First Search; Binary Tree; |
| 57 | Insert Interval | Medium | 9432 | 39.8% | Array; |
| 410 | Split Array Largest Sum | Hard | 9407 | 54.9% | Array; Binary Search; Dynamic Programming; Greedy; Prefix Sum; |
| 90 | Subsets II | Medium | 9383 | 56.9% | Array; Backtracking; Bit Manipulation; |
| 112 | Path Sum | Easy | 9377 | 49.8% | Tree; Depth-First Search; Breadth-First Search; Binary Tree; |
| 123 | Best Time to Buy and Sell Stock III | Hard | 9371 | 47.4% | Array; Dynamic Programming; |
| 547 | Number of Provinces | Medium | 9327 | 65.8% | Depth-First Search; Breadth-First Search; Union Find; Graph; |
| 229 | Majority Element II | Medium | 9298 | 50.9% | Array; Hash Table; Sorting; Counting; |
| 621 | Task Scheduler | Medium | 9284 | 58.1% | Array; Hash Table; Greedy; Sorting; Heap (Priority Queue); Counting; |
| 516 | Longest Palindromic Subsequence | Medium | 9267 | 62.4% | String; Dynamic Programming; |
| 392 | Is Subsequence | Easy | 9249 | 47.9% | Two Pointers; String; Dynamic Programming; |
| 61 | Rotate List | Medium | 9246 | 37.2% | Linked List; Two Pointers; |
| 50 | Pow(x, n) | Medium | 9235 | 34.3% | Math; Recursion; |
| 120 | Triangle | Medium | 9224 | 56.1% | Array; Dynamic Programming; |
| 37 | Sudoku Solver | Hard | 9178 | 60.1% | Array; Hash Table; Backtracking; Matrix; |
| 448 | Find All Numbers Disappeared in an Array | Easy | 9175 | 60.7% | Array; Hash Table; |
| 309 | Best Time to Buy and Sell Stock with Cooldown | Medium | 9153 | 57.7% | Array; Dynamic Programming; |
| 212 | Word Search II | Hard | 9146 | 36.2% | Array; String; Backtracking; Trie; Matrix; |
| 133 | Clone Graph | Medium | 9138 | 56.1% | Hash Table; Depth-First Search; Breadth-First Search; Graph; |
| 542 | 01 Matrix | Medium | 9121 | 48.1% | Array; Dynamic Programming; Breadth-First Search; Matrix; |
| 67 | Add Binary | Easy | 9108 | 53.1% | Math; String; Bit Manipulation; Simulation; |
| 518 | Coin Change II | Medium | 9059 | 63.5% | Array; Dynamic Programming; |
| 1056 | Capacity To Ship Packages Within D Days | Medium | 9058 | 68.9% | Array; Binary Search; |
| 803 | Cheapest Flights Within K Stops | Medium | 9012 | 37.4% | Dynamic Programming; Depth-First Search; Breadth-First Search; Graph; Heap (Priority Queue); Shortest Path; |
| 399 | Evaluate Division | Medium | 8957 | 61.5% | Array; Depth-First Search; Breadth-First Search; Union Find; Graph; Shortest Path; |
| 380 | Insert Delete GetRandom O(1) | Medium | 8956 | 54.3% | Array; Hash Table; Math; Design; Randomized; |
| 66 | Plus One | Easy | 8861 | 44.7% | Array; Math; |
| 125 | Valid Palindrome | Easy | 8801 | 46.6% | Two Pointers; String; |
| 329 | Longest Increasing Path in a Matrix | Hard | 8763 | 53.3% | Array; Dynamic Programming; Depth-First Search; Breadth-First Search; Graph; Topological Sort; Memoization; Matrix; |
| 312 | Burst Balloons | Hard | 8736 | 58.4% | Array; Dynamic Programming; |
| 450 | Delete Node in a BST | Medium | 8731 | 51.0% | Tree; Binary Search Tree; Binary Tree; |
| 315 | Count of Smaller Numbers After Self | Hard | 8664 | 42.4% | Array; Binary Search; Divide and Conquer; Binary Indexed Tree; Segment Tree; Merge Sort; Ordered Set; |
| 617 | Merge Two Binary Trees | Easy | 8642 | 78.9% | Tree; Depth-First Search; Breadth-First Search; Binary Tree; |
| 1019 | Squares of a Sorted Array | Easy | 8614 | 71.8% | Array; Two Pointers; Sorting; |
| 82 | Remove Duplicates from Sorted List II | Medium | 8549 | 47.0% | Linked List; Two Pointers; |
| 63 | Unique Paths II | Medium | 8468 | 41.2% | Array; Dynamic Programming; Matrix; |
| 402 | Remove K Digits | Medium | 8449 | 30.9% | String; Stack; Greedy; Monotonic Stack; |
| 662 | Maximum Width of Binary Tree | Medium | 8434 | 42.8% | Tree; Depth-First Search; Breadth-First Search; Binary Tree; |
| 316 | Remove Duplicate Letters | Medium | 8423 | 49.2% | String; Stack; Greedy; Monotonic Stack; |
| 387 | First Unique Character in a String | Easy | 8420 | 60.5% | Hash Table; String; Queue; Counting; |
| 83 | Remove Duplicates from Sorted List | Easy | 8381 | 52.0% | Linked List; |
| 222 | Count Complete Tree Nodes | Easy | 8368 | 64.0% | Binary Search; Bit Manipulation; Tree; Binary Tree; |
| 337 | House Robber III | Medium | 8339 | 54.1% | Dynamic Programming; Tree; Depth-First Search; Binary Tree; |
| 47 | Permutations II | Medium | 8311 | 58.6% | Array; Backtracking; |
| 173 | Binary Search Tree Iterator | Medium | 8308 | 71.4% | Stack; Tree; Design; Binary Search Tree; Binary Tree; Iterator; |
| 130 | Surrounded Regions | Medium | 8283 | 38.7% | Array; Depth-First Search; Breadth-First Search; Union Find; Matrix; |
| 778 | Reorganize String | Medium | 8265 | 54.4% | Hash Table; String; Greedy; Sorting; Heap (Priority Queue); Counting; |
| 278 | First Bad Version | Easy | 8206 | 44.1% | Binary Search; Interactive; |
| 81 | Search in Rotated Sorted Array II | Medium | 8187 | 37.4% | Array; Binary Search; |
| 1014 | K Closest Points to Origin | Medium | 8177 | 66.1% | Array; Math; Divide and Conquer; Geometry; Sorting; Heap (Priority Queue); Quickselect; |
| 344 | Reverse String | Easy | 8165 | 77.5% | Two Pointers; String; |
Comments (0)