| ID | Title | Difficulty | Likes | AC Rate | Tags |
|---|---|---|---|---|---|
| 733 | Flood Fill | Easy | 8101 | 63.5% | Array; Depth-First Search; Breadth-First Search; Matrix; |
| 1046 | Max Consecutive Ones III | Medium | 8072 | 62.6% | Array; Binary Search; Sliding Window; Prefix Sum; |
| 203 | Remove Linked List Elements | Easy | 8060 | 48.0% | Linked List; Recursion; |
| 205 | Isomorphic Strings | Easy | 8056 | 43.5% | Hash Table; String; |
| 724 | Find Pivot Index | Easy | 8051 | 56.8% | Array; Prefix Sum; |
| 77 | Combinations | Medium | 7997 | 69.9% | Backtracking; |
| 44 | Wildcard Matching | Hard | 7995 | 27.5% | String; Dynamic Programming; Greedy; Recursion; |
| 97 | Interleaving String | Medium | 7988 | 39.6% | String; Dynamic Programming; |
| 680 | Valid Palindrome II | Easy | 7984 | 40.1% | Two Pointers; String; Greedy; |
| 572 | Subtree of Another Tree | Easy | 7975 | 47.5% | Tree; Depth-First Search; String Matching; Binary Tree; Hash Function; |
| 801 | Is Graph Bipartite? | Medium | 7961 | 55.3% | Depth-First Search; Breadth-First Search; Union Find; Graph; |
| 151 | Reverse Words in a String | Medium | 7905 | 39.8% | Two Pointers; String; |
| 658 | Find K Closest Elements | Medium | 7879 | 47.1% | Array; Two Pointers; Binary Search; Sliding Window; Sorting; Heap (Priority Queue); |
| 1013 | Fibonacci Number | Easy | 7878 | 70.6% | Math; Dynamic Programming; Recursion; Memoization; |
| 435 | Non-overlapping Intervals | Medium | 7817 | 52.8% | Array; Dynamic Programming; Greedy; Sorting; |
| 69 | Sqrt(x) | Easy | 7800 | 38.3% | Math; Binary Search; |
| 106 | Construct Binary Tree from Inorder and Postorder Traversal | Medium | 7791 | 62.1% | Array; Hash Table; Divide and Conquer; Tree; Binary Tree; |
| 179 | Largest Number | Medium | 7784 | 35.7% | Array; String; Greedy; Sorting; |
| 943 | Sum of Subarray Minimums | Medium | 7779 | 37.5% | Array; Dynamic Programming; Stack; Monotonic Stack; |
| 334 | Increasing Triplet Subsequence | Medium | 7770 | 40.4% | Array; Greedy; |
| 144 | Binary Tree Preorder Traversal | Easy | 7767 | 68.9% | Stack; Tree; Depth-First Search; Binary Tree; |
| 113 | Path Sum II | Medium | 7733 | 58.1% | Backtracking; Tree; Depth-First Search; Binary Tree; |
| 204 | Count Primes | Medium | 7671 | 33.4% | Array; Math; Enumeration; Number Theory; |
| 99 | Recover Binary Search Tree | Medium | 7667 | 52.6% | Tree; Depth-First Search; Binary Search Tree; Binary Tree; |
| 1025 | Minimum Cost For Tickets | Medium | 7663 | 65.4% | Array; Dynamic Programming; |
| 503 | Next Greater Element II | Medium | 7648 | 63.6% | Array; Stack; Monotonic Stack; |
| 581 | Shortest Unsorted Continuous Subarray | Medium | 7643 | 36.7% | Array; Two Pointers; Stack; Greedy; Sorting; Monotonic Stack; |
| 1603 | Running Sum of 1d Array | Easy | 7607 | 86.6% | Array; Prefix Sum; |
| 137 | Single Number II | Medium | 7606 | 62.1% | Array; Bit Manipulation; |
| 496 | Next Greater Element I | Easy | 7510 | 71.9% | Array; Hash Table; Stack; Monotonic Stack; |
| 451 | Sort Characters By Frequency | Medium | 7504 | 70.7% | Hash Table; String; Sorting; Heap (Priority Queue); Bucket Sort; Counting; |
| 692 | Top K Frequent Words | Medium | 7502 | 57.7% | Hash Table; String; Trie; Sorting; Heap (Priority Queue); Bucket Sort; Counting; |
| 735 | Asteroid Collision | Medium | 7502 | 44.8% | Array; Stack; Simulation; |
| 135 | Candy | Hard | 7460 | 43.2% | Array; Greedy; |
| 95 | Unique Binary Search Trees II | Medium | 7421 | 57.1% | Dynamic Programming; Backtracking; Tree; Binary Search Tree; Binary Tree; |
| 129 | Sum Root to Leaf Numbers | Medium | 7419 | 62.9% | Tree; Depth-First Search; Binary Tree; |
| 211 | Design Add and Search Words Data Structure | Medium | 7396 | 44.8% | String; Depth-First Search; Design; Trie; |
| 874 | Backspace String Compare | Easy | 7384 | 49.1% | Two Pointers; String; Stack; Simulation; |
| 310 | Minimum Height Trees | Medium | 7366 | 38.8% | Depth-First Search; Breadth-First Search; Graph; Topological Sort; |
| 740 | Delete and Earn | Medium | 7346 | 56.5% | Array; Hash Table; Dynamic Programming; |
| 109 | Convert Sorted List to Binary Search Tree | Medium | 7293 | 61.4% | Linked List; Divide and Conquer; Tree; Binary Search Tree; Binary Tree; |
| 377 | Combination Sum IV | Medium | 7249 | 54.0% | Array; Dynamic Programming; |
| 188 | Best Time to Buy and Sell Stock IV | Hard | 7236 | 41.9% | Array; Dynamic Programming; |
| 1029 | Vertical Order Traversal of a Binary Tree | Hard | 7233 | 46.9% | Hash Table; Tree; Depth-First Search; Breadth-First Search; Binary Tree; |
| 882 | Peak Index in a Mountain Array | Medium | 7227 | 68.6% | Array; Binary Search; |
| 6 | Zigzag Conversion | Medium | 7190 | 47.0% | String; |
| 744 | Network Delay Time | Medium | 7167 | 53.3% | Depth-First Search; Breadth-First Search; Graph; Heap (Priority Queue); Shortest Path; |
| 86 | Partition List | Medium | 7140 | 55.7% | Linked List; Two Pointers; |
| 417 | Pacific Atlantic Water Flow | Medium | 7105 | 55.0% | Array; Depth-First Search; Breadth-First Search; Matrix; |
| 111 | Minimum Depth of Binary Tree | Easy | 7101 | 47.3% | Tree; Depth-First Search; Breadth-First Search; Binary Tree; |
| 1129 | Longest String Chain | Medium | 7093 | 60.9% | Array; Hash Table; Two Pointers; String; Dynamic Programming; |
| 813 | All Paths From Source to Target | Medium | 7040 | 82.4% | Backtracking; Depth-First Search; Breadth-First Search; Graph; |
| 350 | Intersection of Two Arrays II | Easy | 7027 | 56.3% | Array; Hash Table; Two Pointers; Binary Search; Sorting; |
| 456 | 132 Pattern | Medium | 7025 | 33.7% | Array; Binary Search; Stack; Monotonic Stack; Ordered Set; |
| 290 | Word Pattern | Easy | 7022 | 41.8% | Hash Table; String; |
| 698 | Partition to K Equal Sum Subsets | Medium | 6981 | 38.6% | Array; Dynamic Programming; Backtracking; Bit Manipulation; Memoization; Bitmask; |
| 406 | Queue Reconstruction by Height | Medium | 6980 | 73.3% | Array; Binary Indexed Tree; Segment Tree; Sorting; |
| 232 | Implement Queue using Stacks | Easy | 6947 | 64.4% | Stack; Design; Queue; |
| 714 | Best Time to Buy and Sell Stock with Transaction Fee | Medium | 6937 | 68.3% | Array; Dynamic Programming; Greedy; |
| 525 | Contiguous Array | Medium | 6911 | 46.9% | Array; Hash Table; Prefix Sum; |
| 150 | Evaluate Reverse Polish Notation | Medium | 6895 | 48.8% | Array; Math; Stack; |
| 43 | Multiply Strings | Medium | 6854 | 39.9% | Math; String; Simulation; |
| 975 | Range Sum of BST | Easy | 6814 | 86.7% | Tree; Depth-First Search; Binary Search Tree; Binary Tree; |
| 253 | Meeting Rooms II | Medium | 6811 | 51.0% | Array; Two Pointers; Greedy; Sorting; Heap (Priority Queue); Prefix Sum; |
| 12 | Integer to Roman | Medium | 6726 | 64.0% | Hash Table; Math; String; |
| 145 | Binary Tree Postorder Traversal | Easy | 6691 | 70.3% | Stack; Tree; Depth-First Search; Binary Tree; |
| 452 | Minimum Number of Arrows to Burst Balloons | Medium | 6672 | 56.0% | Array; Greedy; Sorting; |
| 718 | Maximum Length of Repeated Subarray | Medium | 6658 | 51.0% | Array; Binary Search; Dynamic Programming; Sliding Window; Rolling Hash; Hash Function; |
| 140 | Word Break II | Hard | 6631 | 47.2% | Array; Hash Table; String; Dynamic Programming; Backtracking; Trie; Memoization; |
| 1352 | Maximum Profit in Job Scheduling | Hard | 6628 | 54.8% | Array; Binary Search; Dynamic Programming; Sorting; |
| 673 | Number of Longest Increasing Subsequence | Medium | 6577 | 47.8% | Array; Dynamic Programming; Binary Indexed Tree; Segment Tree; |
| 653 | Two Sum IV - Input is a BST | Easy | 6555 | 61.1% | Hash Table; Two Pointers; Tree; Depth-First Search; Breadth-First Search; Binary Search Tree; Binary Tree; |
| 60 | Permutation Sequence | Hard | 6482 | 46.2% | Math; Recursion; |
| 1016 | Subarray Sums Divisible by K | Medium | 6469 | 53.9% | Array; Hash Table; Prefix Sum; |
| 80 | Remove Duplicates from Sorted Array II | Medium | 6444 | 56.8% | Array; Two Pointers; |
| 721 | Accounts Merge | Medium | 6437 | 56.8% | Array; Hash Table; String; Depth-First Search; Breadth-First Search; Union Find; Sorting; |
| 115 | Distinct Subsequences | Hard | 6416 | 46.2% | String; Dynamic Programming; |
| 954 | Maximum Sum Circular Subarray | Medium | 6409 | 44.3% | Array; Divide and Conquer; Dynamic Programming; Queue; Monotonic Queue; |
| 1128 | Remove All Adjacent Duplicates In String | Easy | 6404 | 69.2% | String; Stack; |
| 257 | Binary Tree Paths | Easy | 6376 | 63.1% | String; Backtracking; Tree; Depth-First Search; Binary Tree; |
| 191 | Number of 1 Bits | Easy | 6336 | 70.1% | Divide and Conquer; Bit Manipulation; |
| 1646 | Kth Missing Positive Number | Easy | 6270 | 59.4% | Array; Binary Search; |
| 459 | Repeated Substring Pattern | Easy | 6263 | 46.0% | String; String Matching; |
| 1171 | Shortest Path in Binary Matrix | Medium | 6256 | 47.0% | Array; Breadth-First Search; Matrix; |
| 605 | Can Place Flowers | Easy | 6214 | 29.6% | Array; Greedy; |
| 231 | Power of Two | Easy | 6206 | 46.6% | Math; Bit Manipulation; Recursion; |
| 59 | Spiral Matrix II | Medium | 6199 | 70.6% | Array; Matrix; Simulation; |
| 289 | Game of Life | Medium | 6183 | 68.6% | Array; Matrix; Simulation; |
| 463 | Island Perimeter | Easy | 6168 | 70.2% | Array; Depth-First Search; Breadth-First Search; Matrix; |
| 967 | Minimum Falling Path Sum | Medium | 6086 | 64.9% | Array; Dynamic Programming; Matrix; |
| 1371 | Minimum Remove to Make Valid Parentheses | Medium | 6079 | 66.9% | String; Stack; |
| 224 | Basic Calculator | Hard | 6077 | 43.0% | Math; String; Stack; Recursion; |
| 937 | Online Stock Span | Medium | 6043 | 65.6% | Stack; Design; Monotonic Stack; Data Stream; |
| 1300 | Critical Connections in a Network | Hard | 6033 | 55.5% | Depth-First Search; Graph; Biconnected Component; |
| 373 | Find K Pairs with Smallest Sums | Medium | 6019 | 40.0% | Array; Heap (Priority Queue); |
| 395 | Longest Substring with At Least K Repeating Characters | Medium | 6017 | 44.9% | Hash Table; String; Divide and Conquer; Sliding Window; |
| 227 | Basic Calculator II | Medium | 5988 | 43.2% | Math; String; Stack; |
| 684 | Redundant Connection | Medium | 5973 | 62.6% | Depth-First Search; Breadth-First Search; Union Find; Graph; |
| 1039 | Find the Town Judge | Easy | 5955 | 49.1% | Array; Hash Table; Graph; |
| 713 | Subarray Product Less Than K | Medium | 5946 | 47.0% | Array; Sliding Window; |
Comments (0)