| ID | Title | Difficulty | Likes | AC Rate | Tags |
|---|---|---|---|---|---|
| 1050 | Construct Binary Search Tree from Preorder Traversal | Medium | 5939 | 81.8% | Array; Stack; Tree; Binary Search Tree; Monotonic Stack; Binary Tree; |
| 871 | Keys and Rooms | Medium | 5898 | 72.6% | Depth-First Search; Breadth-First Search; Graph; |
| 1538 | Maximum Points You Can Obtain from Cards | Medium | 5875 | 52.3% | Array; Sliding Window; Prefix Sum; |
| 219 | Contains Duplicate II | Easy | 5864 | 44.4% | Array; Hash Table; Sliding Window; |
| 493 | Reverse Pairs | Hard | 5863 | 30.6% | Array; Binary Search; Divide and Conquer; Binary Indexed Tree; Segment Tree; Merge Sort; Ordered Set; |
| 126 | Word Ladder II | Hard | 5845 | 27.3% | Hash Table; String; Backtracking; Breadth-First Search; |
| 264 | Ugly Number II | Medium | 5830 | 46.2% | Hash Table; Math; Dynamic Programming; Heap (Priority Queue); |
| 1127 | Last Stone Weight | Easy | 5819 | 65.2% | Array; Heap (Priority Queue); |
| 983 | Validate Stack Sequences | Medium | 5813 | 69.4% | Array; Stack; Simulation; |
| 225 | Implement Stack using Queues | Easy | 5808 | 63.0% | Stack; Design; Queue; |
| 354 | Russian Doll Envelopes | Hard | 5802 | 37.2% | Array; Binary Search; Dynamic Programming; Sorting; |
| 557 | Reverse Words in a String III | Easy | 5797 | 82.9% | Two Pointers; String; |
| 948 | Sort an Array | Medium | 5794 | 57.1% | Array; Divide and Conquer; Sorting; Heap (Priority Queue); Merge Sort; Bucket Sort; Radix Sort; Counting Sort; |
| 445 | Add Two Numbers II | Medium | 5787 | 61.1% | Linked List; Math; Stack; |
| 218 | The Skyline Problem | Hard | 5783 | 42.5% | Array; Divide and Conquer; Binary Indexed Tree; Segment Tree; Line Sweep; Heap (Priority Queue); Ordered Set; |
| 216 | Combination Sum III | Medium | 5762 | 69.2% | Array; Backtracking; |
| 917 | Boats to Save People | Medium | 5761 | 56.4% | Array; Two Pointers; Greedy; Sorting; |
| 783 | Search in a Binary Search Tree | Easy | 5757 | 79.2% | Tree; Binary Search Tree; Binary Tree; |
| 301 | Remove Invalid Parentheses | Hard | 5754 | 47.9% | String; Backtracking; Breadth-First Search; |
| 332 | Reconstruct Itinerary | Hard | 5738 | 43.3% | Depth-First Search; Graph; Eulerian Circuit; |
| 669 | Trim a Binary Search Tree | Medium | 5721 | 66.3% | Tree; Depth-First Search; Binary Search Tree; Binary Tree; |
| 117 | Populating Next Right Pointers in Each Node II | Medium | 5709 | 51.9% | Linked List; Tree; Depth-First Search; Breadth-First Search; Binary Tree; |
| 486 | Predict the Winner | Medium | 5708 | 55.4% | Array; Math; Dynamic Programming; Recursion; Game Theory; |
| 652 | Find Duplicate Subtrees | Medium | 5691 | 59.3% | Hash Table; Tree; Depth-First Search; Binary Tree; |
| 174 | Dungeon Game | Hard | 5651 | 37.9% | Array; Dynamic Programming; Matrix; |
| 665 | Non-decreasing Array | Medium | 5636 | 24.6% | Array; |
| 1320 | Remove All Adjacent Duplicates in String II | Medium | 5636 | 57.2% | String; Stack; |
| 1753 | Path With Minimum Effort | Medium | 5621 | 59.3% | Array; Binary Search; Depth-First Search; Breadth-First Search; Union Find; Heap (Priority Queue); Matrix; |
| 784 | Insert into a Binary Search Tree | Medium | 5620 | 73.9% | Tree; Binary Search Tree; Binary Tree; |
| 583 | Delete Operation for Two Strings | Medium | 5609 | 61.2% | String; Dynamic Programming; |
| 1544 | Count Good Nodes in Binary Tree | Medium | 5599 | 73.2% | Tree; Depth-First Search; Breadth-First Search; Binary Tree; |
| 1580 | Shuffle the Array | Easy | 5576 | 88.4% | Array; |
| 260 | Single Number III | Medium | 5570 | 68.2% | Array; Bit Manipulation; |
| 349 | Intersection of Two Arrays | Easy | 5485 | 72.2% | Array; Hash Table; Two Pointers; Binary Search; Sorting; |
| 460 | LFU Cache | Hard | 5479 | 43.9% | Hash Table; Linked List; Design; Doubly-Linked List; |
| 820 | Find Eventual Safe States | Medium | 5471 | 62.0% | Depth-First Search; Breadth-First Search; Graph; Topological Sort; |
| 485 | Max Consecutive Ones | Easy | 5469 | 58.3% | Array; |
| 403 | Frog Jump | Hard | 5448 | 45.9% | Array; Dynamic Programming; |
| 1028 | Interval List Intersections | Medium | 5411 | 71.4% | Array; Two Pointers; |
| 168 | Excel Sheet Column Title | Easy | 5411 | 40.1% | Math; String; |
| 808 | Number of Matching Subsequences | Medium | 5397 | 51.2% | Array; Hash Table; String; Binary Search; Dynamic Programming; Trie; Sorting; |
| 28 | Find the Index of the First Occurrence in a String | Easy | 5369 | 41.5% | Two Pointers; String; String Matching; |
| 523 | Continuous Subarray Sum | Medium | 5356 | 28.7% | Array; Hash Table; Math; Prefix Sum; |
| 421 | Maximum XOR of Two Numbers in an Array | Medium | 5338 | 53.5% | Array; Hash Table; Bit Manipulation; Trie; |
| 1776 | Minimum Operations to Reduce X to Zero | Medium | 5335 | 39.7% | Array; Hash Table; Binary Search; Sliding Window; Prefix Sum; |
| 886 | Score of Parentheses | Medium | 5326 | 64.3% | String; Stack; |
| 474 | Ones and Zeroes | Medium | 5309 | 47.3% | Array; String; Dynamic Programming; |
| 132 | Palindrome Partitioning II | Hard | 5289 | 33.7% | String; Dynamic Programming; |
| 1482 | How Many Numbers Are Smaller Than the Current Number | Easy | 5289 | 86.6% | Array; Hash Table; Sorting; Counting; |
| 71 | Simplify Path | Medium | 5283 | 41.6% | String; Stack; |
| 941 | Sort Array By Parity | Easy | 5266 | 76.2% | Array; Two Pointers; Sorting; |
| 413 | Arithmetic Slices | Medium | 5263 | 65.1% | Array; Dynamic Programming; |
| 789 | Kth Largest Element in a Stream | Easy | 5260 | 56.6% | Tree; Design; Binary Search Tree; Heap (Priority Queue); Binary Tree; Data Stream; |
| 241 | Different Ways to Add Parentheses | Medium | 5243 | 65.1% | Math; String; Dynamic Programming; Recursion; Memoization; |
| 971 | Shortest Bridge | Medium | 5232 | 57.7% | Array; Depth-First Search; Breadth-First Search; Matrix; |
| 409 | Longest Palindrome | Easy | 5216 | 53.9% | Hash Table; String; Greedy; |
| 984 | Most Stones Removed with Same Row or Column | Medium | 5198 | 58.9% | Hash Table; Depth-First Search; Union Find; Graph; |
| 1635 | Number of Good Pairs | Easy | 5194 | 88.9% | Array; Hash Table; Math; Counting; |
| 528 | Swapping Nodes in a Linked List | Medium | 5192 | 68.1% | Linked List; Two Pointers; |
| 1008 | Binary Tree Cameras | Hard | 5180 | 46.5% | Dynamic Programming; Tree; Depth-First Search; Binary Tree; |
| 637 | Average of Levels in Binary Tree | Easy | 5134 | 72.2% | Tree; Depth-First Search; Breadth-First Search; Binary Tree; |
| 654 | Maximum Binary Tree | Medium | 5102 | 85.2% | Array; Divide and Conquer; Stack; Tree; Monotonic Stack; Binary Tree; |
| 538 | Convert BST to Greater Tree | Medium | 5094 | 68.7% | Tree; Depth-First Search; Binary Search Tree; Binary Tree; |
| 93 | Restore IP Addresses | Medium | 5072 | 49.2% | String; Backtracking; |
| 368 | Largest Divisible Subset | Medium | 5062 | 42.3% | Array; Math; Dynamic Programming; Sorting; |
| 678 | Valid Parenthesis String | Medium | 5060 | 34.7% | String; Dynamic Programming; Stack; Greedy; |
| 1022 | Unique Paths III | Hard | 5011 | 81.8% | Array; Backtracking; Bit Manipulation; Matrix; |
| 817 | Design HashMap | Easy | 5008 | 65.8% | Array; Hash Table; Linked List; Design; Hash Function; |
| 376 | Wiggle Subsequence | Medium | 5003 | 48.4% | Array; Dynamic Programming; Greedy; |
| 343 | Integer Break | Medium | 5002 | 60.1% | Math; Dynamic Programming; |
| 782 | Jewels and Stones | Easy | 4956 | 88.4% | Hash Table; String; |
| 1034 | Subarrays with K Different Integers | Hard | 4954 | 56.3% | Array; Hash Table; Sliding Window; Counting; |
| 190 | Reverse Bits | Easy | 4947 | 57.4% | Divide and Conquer; Bit Manipulation; |
| 1263 | Number of Dice Rolls With Target Sum | Medium | 4945 | 60.7% | Dynamic Programming; |
| 930 | All Possible Full Binary Trees | Medium | 4944 | 82.8% | Dynamic Programming; Tree; Recursion; Memoization; Binary Tree; |
| 404 | Sum of Left Leaves | Easy | 4935 | 57.6% | Tree; Depth-First Search; Breadth-First Search; Binary Tree; |
| 863 | Sum of Distances in Tree | Hard | 4922 | 59.3% | Dynamic Programming; Tree; Depth-First Search; Graph; |
| 766 | Flatten a Multilevel Doubly Linked List | Medium | 4896 | 59.9% | Linked List; Depth-First Search; Doubly-Linked List; |
| 415 | Add Strings | Easy | 4886 | 51.8% | Math; String; Simulation; |
| 1021 | Distribute Coins in Binary Tree | Medium | 4876 | 72.5% | Tree; Depth-First Search; Binary Tree; |
| 29 | Divide Two Integers | Medium | 4873 | 17.2% | Math; Bit Manipulation; |
| 389 | Find the Difference | Easy | 4859 | 60.0% | Hash Table; String; Bit Manipulation; Sorting; |
| 1706 | Min Cost to Connect All Points | Medium | 4857 | 66.5% | Array; Union Find; Graph; Minimum Spanning Tree; |
| 1770 | Minimum Deletions to Make Character Frequencies Unique | Medium | 4853 | 61.2% | Hash Table; String; Greedy; Sorting; |
| 1092 | Maximum Difference Between Node and Ancestor | Medium | 4849 | 78.2% | Tree; Depth-First Search; Binary Tree; |
| 1476 | Count Negative Numbers in a Sorted Matrix | Easy | 4848 | 77.2% | Array; Binary Search; Matrix; |
| 1319 | Unique Number of Occurrences | Easy | 4847 | 76.9% | Array; Hash Table; |
| 454 | 4Sum II | Medium | 4846 | 57.2% | Array; Hash Table; |
| 1442 | Number of Operations to Make Network Connected | Medium | 4842 | 62.5% | Depth-First Search; Breadth-First Search; Union Find; Graph; |
| 1437 | Minimum Insertion Steps to Make a String Palindrome | Hard | 4838 | 70.1% | String; Dynamic Programming; |
| 304 | Range Sum Query 2D - Immutable | Medium | 4831 | 54.0% | Array; Design; Matrix; Prefix Sum; |
| 990 | Verifying an Alien Dictionary | Easy | 4814 | 54.8% | Array; Hash Table; String; |
| 341 | Flatten Nested List Iterator | Medium | 4813 | 64.3% | Stack; Tree; Depth-First Search; Design; Queue; Iterator; |
| 383 | Ransom Note | Easy | 4772 | 60.5% | Hash Table; String; Counting; |
| 1146 | Greatest Common Divisor of Strings | Easy | 4752 | 51.7% | Math; String; |
| 107 | Binary Tree Level Order Traversal II | Medium | 4750 | 62.8% | Tree; Breadth-First Search; Binary Tree; |
| 1402 | Count Square Submatrices with All Ones | Medium | 4748 | 75.0% | Array; Dynamic Programming; Matrix; |
| 443 | String Compression | Medium | 4720 | 53.8% | Two Pointers; String; |
| 119 | Pascal's Triangle II | Easy | 4720 | 63.6% | Array; Dynamic Programming; |
| 258 | Add Digits | Easy | 4678 | 66.3% | Math; Simulation; Number Theory; |
Comments (0)