| ID | Title | Difficulty | Likes | AC Rate | Tags |
|---|---|---|---|---|---|
| 171 | Excel Sheet Column Number | Easy | 4651 | 63.3% | Math; String; |
| 1170 | Shortest Common Supersequence | Hard | 4649 | 59.0% | String; Dynamic Programming; |
| 307 | Range Sum Query - Mutable | Medium | 4628 | 40.8% | Array; Design; Binary Indexed Tree; Segment Tree; |
| 1095 | Two City Scheduling | Medium | 4620 | 66.5% | Array; Greedy; Sorting; |
| 1254 | Deepest Leaves Sum | Medium | 4611 | 86.3% | Tree; Depth-First Search; Breadth-First Search; Binary Tree; |
| 1023 | Time Based Key-Value Store | Medium | 4606 | 49.8% | Hash Table; String; Binary Search; Design; |
| 931 | Maximum Frequency Stack | Hard | 4597 | 66.5% | Hash Table; Stack; Design; Ordered Set; |
| 922 | Possible Bipartition | Medium | 4583 | 50.4% | Depth-First Search; Breadth-First Search; Union Find; Graph; |
| 1087 | Longest Arithmetic Subsequence | Medium | 4572 | 49.0% | Array; Hash Table; Binary Search; Dynamic Programming; |
| 800 | Letter Case Permutation | Medium | 4562 | 74.1% | String; Backtracking; Bit Manipulation; |
| 645 | Set Mismatch | Easy | 4562 | 44.6% | Array; Hash Table; Bit Manipulation; Sorting; |
| 154 | Find Minimum in Rotated Sorted Array II | Hard | 4556 | 43.6% | Array; Binary Search; |
| 1397 | Search Suggestions System | Medium | 4551 | 65.5% | Array; String; Binary Search; Trie; Sorting; Heap (Priority Queue); |
| 902 | Minimum Number of Refueling Stops | Hard | 4547 | 39.9% | Array; Dynamic Programming; Greedy; Heap (Priority Queue); |
| 1762 | Furthest Building You Can Reach | Medium | 4534 | 48.5% | Array; Greedy; Heap (Priority Queue); |
| 58 | Length of Last Word | Easy | 4481 | 48.2% | String; |
| 646 | Maximum Length of Pair Chain | Medium | 4468 | 59.6% | Array; Dynamic Programming; Greedy; Sorting; |
| 940 | Fruit Into Baskets | Medium | 4445 | 43.9% | Array; Hash Table; Sliding Window; |
| 832 | Binary Tree Pruning | Medium | 4442 | 72.2% | Tree; Depth-First Search; Binary Tree; |
| 1380 | Number of Closed Islands | Medium | 4437 | 66.4% | Array; Depth-First Search; Breadth-First Search; Union Find; Matrix; |
| 1414 | Shortest Path in a Grid with Obstacles Elimination | Hard | 4412 | 45.2% | Array; Breadth-First Search; Matrix; |
| 336 | Palindrome Pairs | Hard | 4410 | 35.1% | Array; Hash Table; String; Trie; |
| 962 | Flip String to Monotone Increasing | Medium | 4353 | 61.4% | String; Dynamic Programming; |
| 659 | Split Array into Consecutive Subsequences | Medium | 4348 | 51.0% | Array; Hash Table; Greedy; Heap (Priority Queue); |
| 1184 | Car Pooling | Medium | 4346 | 56.2% | Array; Sorting; Heap (Priority Queue); Simulation; Prefix Sum; |
| 1360 | Maximum Length of a Concatenated String with Unique Characters | Medium | 4345 | 54.1% | Array; String; Backtracking; Bit Manipulation; |
| 269 | Alien Dictionary | Hard | 4338 | 35.6% | Array; String; Depth-First Search; Breadth-First Search; Graph; Topological Sort; |
| 345 | Reverse Vowels of a String | Easy | 4304 | 52.3% | Two Pointers; String; |
| 745 | Find Smallest Letter Greater Than Target | Easy | 4287 | 51.6% | Array; Binary Search; |
| 1966 | Frequency of the Most Frequent Element | Medium | 4277 | 46.2% | Array; Binary Search; Greedy; Sliding Window; Sorting; Prefix Sum; |
| 530 | Minimum Absolute Difference in BST | Easy | 4239 | 58.5% | Tree; Depth-First Search; Breadth-First Search; Binary Search Tree; Binary Tree; |
| 933 | Increasing Order Search Tree | Easy | 4237 | 78.3% | Stack; Tree; Depth-First Search; Binary Search Tree; Binary Tree; |
| 237 | Delete Node in a Linked List | Medium | 4228 | 77.9% | Linked List; |
| 1528 | Kids With the Greatest Number of Candies | Easy | 4219 | 87.2% | Array; |
| 877 | Shortest Path Visiting All Nodes | Hard | 4212 | 65.8% | Dynamic Programming; Bit Manipulation; Breadth-First Search; Graph; Bitmask; |
| 1228 | Minimum Cost Tree From Leaf Values | Medium | 4188 | 67.9% | Array; Dynamic Programming; Stack; Greedy; Monotonic Stack; |
| 687 | Longest Univalue Path | Medium | 4168 | 41.1% | Tree; Depth-First Search; Binary Tree; |
| 1791 | Richest Customer Wealth | Easy | 4159 | 87.7% | Array; Matrix; |
| 998 | Check Completeness of a Binary Tree | Medium | 4156 | 56.6% | Tree; Breadth-First Search; Binary Tree; |
| 8 | String to Integer (atoi) | Medium | 4152 | 17.0% | String; |
| 892 | Shortest Subarray with Sum at Least K | Hard | 4146 | 26.0% | Array; Binary Search; Queue; Sliding Window; Heap (Priority Queue); Prefix Sum; Monotonic Queue; |
| 833 | Bus Routes | Hard | 4140 | 48.4% | Array; Hash Table; Breadth-First Search; |
| 1055 | Pairs of Songs With Total Durations Divisible by 60 | Medium | 4134 | 52.8% | Array; Hash Table; Counting; |
| 729 | My Calendar I | Medium | 4128 | 56.6% | Binary Search; Design; Segment Tree; Ordered Set; |
| 741 | Cherry Pickup | Hard | 4103 | 36.7% | Array; Dynamic Programming; Matrix; |
| 367 | Valid Perfect Square | Easy | 4098 | 43.5% | Math; Binary Search; |
| 628 | Maximum Product of Three Numbers | Easy | 4095 | 45.2% | Array; Math; Sorting; |
| 1463 | The K Weakest Rows in a Matrix | Easy | 4087 | 73.4% | Array; Binary Search; Sorting; Heap (Priority Queue); Matrix; |
| 1117 | As Far from Land as Possible | Medium | 4077 | 51.6% | Array; Dynamic Programming; Breadth-First Search; Matrix; |
| 1411 | Convert Binary Number in a Linked List to Integer | Easy | 4061 | 81.3% | Linked List; Math; |
| 1669 | Minimum Cost to Cut a Stick | Hard | 4057 | 62.0% | Array; Dynamic Programming; Sorting; |
| 149 | Max Points on a Line | Hard | 4049 | 26.2% | Array; Hash Table; Math; Geometry; |
| 1428 | Jump Game III | Medium | 4042 | 64.5% | Array; Depth-First Search; Breadth-First Search; |
| 904 | Leaf-Similar Trees | Easy | 4009 | 70.4% | Tree; Depth-First Search; Binary Tree; |
| 371 | Sum of Two Integers | Medium | 4008 | 51.5% | Math; Bit Manipulation; |
| 1236 | N-th Tribonacci Number | Easy | 4000 | 63.5% | Math; Dynamic Programming; Memoization; |
| 1492 | Time Needed to Inform All Employees | Medium | 3984 | 60.0% | Tree; Depth-First Search; Breadth-First Search; |
| 1576 | Reorder Routes to Make All Paths Lead to the City Zero | Medium | 3930 | 65.0% | Depth-First Search; Breadth-First Search; Graph; |
| 712 | Minimum ASCII Delete Sum for Two Strings | Medium | 3909 | 65.0% | String; Dynamic Programming; |
| 957 | Minimum Add to Make Parentheses Valid | Medium | 3901 | 75.1% | String; Stack; Greedy; |
| 696 | Count Binary Substrings | Easy | 3898 | 65.5% | Two Pointers; String; |
| 1035 | Cousins in Binary Tree | Easy | 3892 | 55.6% | Tree; Depth-First Search; Breadth-First Search; Binary Tree; |
| 2216 | Delete the Middle Node of a Linked List | Medium | 3888 | 58.7% | Linked List; Two Pointers; |
| 753 | Open the Lock | Medium | 3863 | 55.9% | Array; Hash Table; String; Breadth-First Search; |
| 926 | Find and Replace Pattern | Medium | 3859 | 77.0% | Array; Hash Table; String; |
| 1073 | Number of Enclaves | Medium | 3856 | 68.7% | Array; Depth-First Search; Breadth-First Search; Union Find; Matrix; |
| 1444 | Number of Steps to Reduce a Number to Zero | Easy | 3829 | 84.9% | Math; Bit Manipulation; |
| 725 | Split Linked List in Parts | Medium | 3824 | 63.9% | Linked List; |
| 501 | Find Mode in Binary Search Tree | Easy | 3809 | 55.7% | Tree; Depth-First Search; Binary Search Tree; Binary Tree; |
| 228 | Summary Ranges | Easy | 3804 | 50.1% | Array; |
| 342 | Power of Four | Easy | 3804 | 47.7% | Math; Bit Manipulation; Recursion; |
| 1761 | Count Sorted Vowel Strings | Medium | 3782 | 78.1% | Math; Dynamic Programming; Combinatorics; |
| 472 | Concatenated Words | Hard | 3778 | 49.6% | Array; String; Dynamic Programming; Depth-First Search; Trie; |
| 1621 | Number of Subsequences That Satisfy the Given Sum Condition | Medium | 3773 | 43.9% | Array; Two Pointers; Binary Search; Sorting; |
| 461 | Hamming Distance | Easy | 3768 | 75.3% | Bit Manipulation; |
| 1207 | Delete Nodes And Return Forest | Medium | 3765 | 69.2% | Array; Hash Table; Tree; Depth-First Search; Binary Tree; |
| 532 | K-diff Pairs in an Array | Medium | 3760 | 42.4% | Array; Hash Table; Two Pointers; Binary Search; Sorting; |
| 688 | Knight Probability in Chessboard | Medium | 3759 | 56.2% | Dynamic Programming; |
| 1700 | Minimum Time to Make Rope Colorful | Medium | 3753 | 64.0% | Array; String; Dynamic Programming; Greedy; |
| 441 | Arranging Coins | Easy | 3753 | 46.5% | Math; Binary Search; |
| 38 | Count and Say | Medium | 3751 | 54.1% | String; |
| 473 | Matchsticks to Square | Medium | 3738 | 40.2% | Array; Dynamic Programming; Backtracking; Bit Manipulation; Bitmask; |
| 1829 | Maximum Units on a Truck | Easy | 3734 | 73.6% | Array; Greedy; Sorting; |
| 1105 | Uncrossed Lines | Medium | 3733 | 62.7% | Array; Dynamic Programming; |
| 52 | N-Queens II | Hard | 3732 | 73.2% | Backtracking; |
| 1586 | Longest Subarray of 1's After Deleting One Element | Medium | 3730 | 67.0% | Array; Dynamic Programming; Sliding Window; |
| 1121 | Partition Array for Maximum Sum | Medium | 3729 | 72.4% | Array; Dynamic Programming; |
| 854 | Making A Large Island | Hard | 3721 | 46.4% | Array; Depth-First Search; Breadth-First Search; Union Find; Matrix; |
| 630 | Course Schedule III | Hard | 3714 | 40.1% | Array; Greedy; Sorting; Heap (Priority Queue); |
| 816 | Design HashSet | Easy | 3698 | 67.1% | Array; Hash Table; Linked List; Design; Hash Function; |
| 611 | Valid Triangle Number | Medium | 3693 | 50.9% | Array; Two Pointers; Binary Search; Greedy; Sorting; |
| 1582 | Design Browser History | Medium | 3690 | 77.5% | Array; Linked List; Stack; Design; Doubly-Linked List; Data Stream; |
| 795 | K-th Symbol in Grammar | Medium | 3689 | 46.3% | Math; Bit Manipulation; Recursion; |
| 455 | Assign Cookies | Easy | 3678 | 52.7% | Array; Two Pointers; Greedy; Sorting; |
| 1114 | Binary Search Tree to Greater Sum Tree | Medium | 3677 | 85.8% | Tree; Depth-First Search; Binary Search Tree; Binary Tree; |
| 355 | Design Twitter | Medium | 3670 | 38.9% | Hash Table; Linked List; Design; Heap (Priority Queue); |
| 1447 | Jump Game IV | Hard | 3668 | 46.4% | Array; Hash Table; Breadth-First Search; |
| 407 | Trapping Rain Water II | Hard | 3667 | 47.8% | Array; Breadth-First Search; Heap (Priority Queue); Matrix; |
| 1119 | Robot Bounded In Circle | Medium | 3661 | 55.6% | Math; String; Simulation; |
| 1370 | Count Number of Nice Subarrays | Medium | 3653 | 64.3% | Array; Hash Table; Math; Sliding Window; |
Comments (0)