| 1 |
|
429 |
|
|
| 2 |
|
116 |
|
|
| 3 |
|
297 |
|
|
| 4 |
|
430 |
|
|
| 5 |
|
284 |
|
|
| 6 |
Get Maximum in Generated Array |
1646 |
Array, Dynamic Programming, Simulation |
Easy |
| 7 |
Minimum Deletions to Make Character Frequencies Unique |
1647 |
String, Greedy, Sorting |
Medium |
| 8 |
Sell Diminishing-Valued Colored Balls |
1648 |
Array, Math, Binary Search, Greedy, Sorting, Heap (Priority Queue) |
Medium |
| 9 |
Design an Ordered Stream |
1656 |
Array, Hash Table, Design, Data Stream |
Easy |
| 10 |
Determine if Two Strings Are Close |
1657 |
Hash Table, String, Sorting |
Medium |
| 11 |
Check If Two String Arrays are Equivalent |
1662 |
Array, String |
Easy |
| 12 |
Smallest String With A Given Numeric Value |
1663 |
String, Greedy |
Medium |
| 13 |
Richest Customer Wealth |
1672 |
Array, Matrix |
Easy |
| 14 |
Find the Most Competitive Subsequence |
1673 |
Array, Stack, Greedy, Monotonic Stack |
Medium |
| 15 |
Minimum Moves to Make Array Complementary |
1674 |
Array, Hash Table, Prefix Sum |
Medium |
| 16 |
Count of Matches in Tournament |
1688 |
Math, Simulation |
Easy |
| 17 |
Partitioning Into Minimum Number Of Deci-Binary Numbers |
1689 |
String, Greedy |
Medium |
| 18 |
Determine if String Halves Are Alike |
1704 |
String, Counting |
Easy |
| 19 |
Maximum Number of Eaten Apples |
1705 |
Array, Greedy, Heap (Priority Queue) |
Medium |
| 20 |
Where Will the Ball Fall |
1706 |
Array, Dynamic Programming, Depth-First Search, Matrix, Simulation |
Medium |
| 21 |
Maximum Units on a Truck |
1710 |
Array, Greedy, Sorting |
Easy |
| 22 |
Count Good Meals |
1711 |
Array, Hash Table |
Medium |
| 23 |
Decode XORed Array |
1720 |
Array, Bit Manipulation |
Easy |
| 24 |
Swapping Nodes in a Linked List |
1721 |
Linked List, Two Pointers |
Medium |
| 25 |
Minimize Hamming Distance After Swap Operations |
1722 |
Array, Depth-First Search, Union Find |
Medium |
| 26 |
Find Minimum Time to Finish All Jobs |
1723 |
Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask |
Hard |
| 27 |
Number Of Rectangles That Can Form The Largest Square |
1725 |
Array |
Easy |
| 28 |
Tuple with Same Product |
1726 |
Array, Hash Table |
Medium |
| 29 |
Largest Submatrix With Rearrangements |
1727 |
Array, Greedy, Sorting, Matrix |
Medium |
| 30 |
Latest Time by Replacing Hidden Digits |
1736 |
String, Greedy |
Easy |
| 31 |
Change Minimum Characters to Satisfy One of Three Conditions |
1737 |
Hash Table, String, Counting, Prefix Sum |
Medium |
| 32 |
Find Kth Largest XOR Coordinate Value |
1738 |
Array, Divide and Conquer, Bit Manipulation, Heap (Priority Queue), Matrix, Prefix Sum, Quickselect |
Medium |
| 33 |
Building Boxes |
1739 |
Math, Binary Search, Greedy |
Hard |
| 34 |
Maximum Number of Balls in a Box |
1742 |
Hash Table, Math, Counting |
Easy |
| 35 |
Restore the Array From Adjacent Pairs |
1743 |
Array, Hash Table |
Medium |
| 36 |
Check if Array Is Sorted and Rotated |
1752 |
Array |
Easy |
| 37 |
Minimum Changes To Make Alternating Binary String |
1758 |
String |
Easy |
| 38 |
Count Number of Homogenous Substrings |
1759 |
Math, String |
Medium |
| 39 |
Minimum Degree of a Connected Trio in a Graph |
1761 |
Graph |
Hard |
| 40 |
Merge Strings Alternately |
1768 |
Two Pointers, String |
Easy |
| 41 |
Minimum Number of Operations to Move All Balls to Each Box |
1769 |
Array, String |
Medium |
| 42 |
Maximum Score from Performing Multiplication Operations |
1770 |
Array, Dynamic Programming |
Medium |
| 43 |
Maximize Palindrome Length From Subsequences |
1771 |
String, Dynamic Programming |
Hard |
| 44 |
Check if Binary String Has at Most One Segment of Ones |
1784 |
String |
Easy |
| 45 |
Check if One String Swap Can Make Strings Equal |
1790 |
Hash Table, String, Counting |
Easy |
| 46 |
Find Center of Star Graph |
1791 |
Graph |
Easy |
| 47 |
Maximum Average Pass Ratio |
1792 |
Array, Greedy, Heap (Priority Queue) |
Medium |
| 48 |
Maximum Ascending Subarray Sum |
1800 |
Array |
Easy |
| 49 |
Number of Orders in the Backlog |
1801 |
Array, Heap (Priority Queue), Simulation |
Medium |
| 50 |
Number of Different Integers in a String |
1805 |
Hash Table, String |
Easy |
| 51 |
Truncate Sentence |
1816 |
Array, String |
Easy |
| 52 |
Finding the Users Active Minutes |
1817 |
Array, Hash Table |
Medium |
| 53 |
Minimum Absolute Sum Difference |
1818 |
Array, Binary Search, Sorting, Ordered Set |
Medium |
| 54 |
Number of Different Subsequences GCDs |
1819 |
Array, Math, Counting, Number Theory |
Hard |
| 55 |
Sign of the Product of an Array |
1822 |
Array, Math |
Easy |
| 56 |
Find the Winner of the Circular Game |
1823 |
Array, Math, Recursion, Queue, Simulation |
Medium |
| 57 |
Minimum Sideway Jumps |
1824 |
Array, Dynamic Programming, Greedy |
Medium |
| 58 |
Finding MK Average |
1825 |
Design, Queue, Heap (Priority Queue), Ordered Set |
Hard |
| 59 |
Maximum Ice Cream Bars |
1833 |
Array, Greedy, Sorting |
Medium |
| 60 |
Single-Threaded CPU |
1834 |
Array, Sorting, Heap (Priority Queue) |
Medium |
| 61 |
Find XOR Sum of All Pairs Bitwise AND |
1835 |
Array, Math, Bit Manipulation |
Hard |
| 62 |
Check if the Sentence Is Pangram |
1832 |
Hash Table, String |
Easy |
| 63 |
Frequency of the Most Frequent Element |
1838 |
Array, Binary Search, Greedy, Sliding Window, Sorting, Prefix Sum |
Medium |
| 64 |
Sum of Digits in Base K |
1837 |
Math |
Easy |
| 65 |
Longest Substring Of All Vowels in Order |
1839 |
String, Sliding Window |
Medium |
| 66 |
Maximum Building Height |
1840 |
Array, Math |
Hard |
| 67 |
Minimum Interval to Include Each Query |
1851 |
Array, Binary Search, Line Sweep, Sorting, Heap (Priority Queue) |
Hard |
| 68 |
Minimum Number of Swaps to Make the Binary String Alternating |
1864 |
String, Greedy |
Medium |
| 69 |
Finding Pairs With a Certain Sum |
1865 |
Array, Hash Table, Design |
Medium |
| 70 |
Minimum Distance to the Target Element |
1848 |
Array |
Easy |
| 71 |
Splitting a String Into Descending Consecutive Values |
1849 |
String, Backtracking |
Medium |
| 72 |
Next Permutation |
31 |
Array, Two Pointers |
Medium |
| 73 |
Minimum Adjacent Swaps to Reach the Kth Smallest Number |
1850 |
Two Pointers, String, Greedy |
Medium |
| 74 |
Maximum Distance Between a Pair of Values |
1855 |
Array, Two Pointers, Binary Search, Greedy |
Medium |
| 75 |
Maximum Subarray Min-Product |
1856 |
Array, Stack, Monotonic Stack, Prefix Sum |
Medium |
| 76 |
Longer Contiguous Segments of Ones than Zeros |
1869 |
String |
Easy |
| 77 |
Minimum Speed to Arrive on Time |
1870 |
Array, Binary Search |
Medium |
| 78 |
Jump Game VII |
1871 |
Two Pointers, String, Prefix Sum |
Medium |
| 79 |
Largest Color Value in a Directed Graph |
1857 |
Hash Table, Dynamic Programming, Graph, Topological Sort, Memoization, Counting |
Hard |
| 80 |
Maximum Population Year |
1854 |
Array, Counting |
Easy |
| 81 |
Process Tasks Using Servers |
1882 |
Array, Heap (Priority Queue) |
Medium |
| 82 |
Sum of All Subset XOR Totals |
1863 |
Array, Backtracking, Bit Manipulation |
Easy |
| 83 |
Number of Ways to Rearrange Sticks With K Sticks Visible |
1866 |
Math, Dynamic Programming, Combinatorics |
Hard |
| 84 |
Determine Whether Matrix Can Be Obtained By Rotation |
1886 |
Array, Matrix |
Easy |
| 85 |
Stone Game VIII |
1872 |
Array, Math, Dynamic Programming, Prefix Sum, Game Theory |
Hard |
| 86 |
Redistribute Characters to Make All Strings Equal |
1897 |
Hash Table, String, Counting |
Easy |
| 87 |
Merge Triplets to Form Target Triplet |
1899 |
Array, Greedy |
Medium |
| 88 |
Check if Word Equals Summation of Two Words |
1880 |
String |
Easy |
| 89 |
Maximum Value after Insertion |
1881 |
String, Greedy |
Medium |
| 90 |
Minimum Skips to Arrive at Meeting On Time |
1883 |
Array, Dynamic Programming |
Hard |
| 91 |
Largest Odd Number in String |
1903 |
Math, String, Greedy |
Easy |
| 92 |
Count Sub Islands |
1905 |
Array, Depth-First Search, Breadth-First Search, Union Find, Matrix |
Medium |
| 93 |
Minimum Absolute Difference Queries |
1906 |
Array, Hash Table |
Medium |
| 94 |
Reduction Operations to Make the Array Elements Equal |
1887 |
Array, Sorting |
Medium |
| 95 |
Minimum Space Wasted From Packaging |
1889 |
Array, Binary Search, Sorting, Prefix Sum |
Hard |
| 96 |
Minimum Number of Flips to Make the Binary String Alternating |
1888 |
String, Greedy |
Medium |
| 97 |
Maximum Product Difference Between Two Pairs |
1913 |
Array, Sorting |
Easy |
| 98 |
Cyclically Rotating a Grid |
1914 |
Array, Matrix, Simulation |
Medium |
| 99 |
Number of Wonderful Substrings |
1915 |
Hash Table, String, Bit Manipulation, Prefix Sum |
Medium |
| 100 |
Count Ways to Build Rooms in an Ant Colony |
1916 |
Math, Dynamic Programming, Tree, Graph, Topological Sort, Combinatorics |
Hard |
| 101 |
Maximum Number of Removable Characters |
1898 |
Array, String, Binary Search |
Medium |
| 102 |
Find K Closest Elements |
658 |
Array, Two Pointers, Binary Search, Sorting, Heap (Priority Queue) |
Medium |
| 103 |
Max Sum of Rectangle No Larger Than K |
363 |
Array, Binary Search, Dynamic Programming, Matrix, Ordered Set |
Hard |
| 104 |
Build Array from Permutation |
1920 |
Array, Simulation |
Easy |
| 105 |
Eliminate Maximum Number of Monsters |
1921 |
Array, Greedy, Sorting |
Medium |
| 106 |
Count Good Numbers |
1922 |
Math, Recursion |
Medium |
| 107 |
Count Vowels Permutation |
1220 |
Dynamic Programming |
Hard |
| 108 |
Gray Code |
89 |
Math, Backtracking, Bit Manipulation |
Medium |
| 109 |
Reshape the Matrix |
566 |
Array, Matrix, Simulation |
Easy |
| 110 |
Remove One Element to Make the Array Strictly Increasing |
1909 |
Array |
Easy |
| 111 |
Remove All Occurrences of a Substring |
1910 |
String |
Medium |
| 112 |
Maximum Alternating Subsequence Sum |
1911 |
Array, Dynamic Programming |
Medium |
| 113 |
Reduce Array Size to The Half |
1338 |
Array, Hash Table, Greedy, Sorting, Heap (Priority Queue) |
Medium |
| 114 |
The Number of Full Rounds You Have Played |
1904 |
Math, String |
Medium |
| 115 |
Kth Smallest Element in a Sorted Matrix |
378 |
Array, Binary Search, Sorting, Heap (Priority Queue), Matrix |
Medium |
| 116 |
Maximum Length of Repeated Subarray |
718 |
Array, Binary Search, Dynamic Programming, Sliding Window, Rolling Hash, Hash Function |
Medium |
| 117 |
Longest Increasing Subsequence |
300 |
Array, Binary Search, Dynamic Programming |
Medium |
| 118 |
Concatenation of Array |
1929 |
Array |
Easy |
| 119 |
Painting a Grid With Three Different Colors |
1931 |
Dynamic Programming |
Hard |
| 120 |
Merge BSTs to Create Single BST |
1932 |
Hash Table, Binary Search, Tree, Depth-First Search, Binary Tree |
Hard |
| 121 |
Unique Length-3 Palindromic Subsequences |
1930 |
Hash Table, String, Prefix Sum |
Medium |
| 122 |
Isomorphic Strings |
205 |
Hash Table, String |
Easy |
| 123 |
Custom Sort String |
791 |
Hash Table, String, Sorting |
Medium |
| 124 |
Find Peak Element |
162 |
Array, Binary Search |
Medium |
| 125 |
Valid Triangle Number |
611 |
Array, Two Pointers, Binary Search, Greedy, Sorting |
Medium |
| 126 |
Count Square Sum Triples |
1925 |
Math, Enumeration |
Easy |
| 127 |
Sum Game |
1927 |
Math, Greedy, Game Theory |
Medium |
| 128 |
Nearest Exit from Entrance in Maze |
1926 |
Array, Breadth-First Search, Matrix |
Medium |
| 129 |
Three Equal Parts |
927 |
Array, Math |
Hard |
| 130 |
Maximum Number of Words You Can Type |
1935 |
Hash Table, String |
Easy |
| 131 |
Add Minimum Number of Rungs |
1936 |
Array, Greedy |
Medium |
| 132 |
Maximum Number of Points with Cost |
1937 |
Array, Dynamic Programming |
Medium |
| 133 |
Push Dominoes |
838 |
Two Pointers, String, Dynamic Programming |
Medium |
| 134 |
Partition Array into Disjoint Intervals |
915 |
Array |
Medium |
| 135 |
Binary Tree Pruning |
814 |
Tree, Depth-First Search, Binary Tree |
Medium |
| 136 |
Sum of Digits of String After Convert |
1945 |
String, Simulation |
Easy |
| 137 |
Maximum Compatibility Score Sum |
1947 |
Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask |
Medium |
| 138 |
Non-negative Integers without Consecutive Ones |
600 |
Dynamic Programming |
Hard |
| 139 |
3Sum Closest |
16 |
Array, Two Pointers, Sorting |
Medium |
| 140 |
Beautiful Array |
932 |
Array, Math, Divide and Conquer |
Medium |
| 141 |
01 Matrix |
542 |
Array, Dynamic Programming, Breadth-First Search, Matrix |
Medium |
| 142 |
Map Sum Pairs |
677 |
Hash Table, String, Design, Trie |
Medium |
| 143 |
Check if All Characters Have Equal Number of Occurrences |
1941 |
Hash Table, String, Counting |
Easy |
| 144 |
The Number of the Smallest Unoccupied Chair |
1942 |
Array, Heap (Priority Queue), Ordered Set |
Medium |
| 145 |
Describe the Painting |
1943 |
Array, Prefix Sum |
Medium |
| 146 |
Number of Visible People in a Queue |
1944 |
Array, Stack, Monotonic Stack |
Hard |
| 147 |
Trapping Rain Water |
42 |
Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack |
Hard |
| 148 |
Three Divisors |
1952 |
Math |
Easy |
| 149 |
Minimum Garden Perimeter to Collect Enough Apples |
1954 |
Math, Binary Search |
Medium |
| 150 |
Count Number of Special Subsequences |
1955 |
Array, Dynamic Programming |
Hard |
| 151 |
Maximum Number of Weeks for Which You Can Work |
1953 |
Array, Greedy |
Medium |
| 152 |
Making A Large Island |
827 |
Array, Depth-First Search, Breadth-First Search, Union Find, Matrix |
Hard |
| 153 |
Subsets II |
90 |
Array, Backtracking, Bit Manipulation |
Medium |
| 154 |
Path Sum II |
113 |
Backtracking, Tree, Depth-First Search, Binary Tree |
Medium |
| 155 |
Combinations |
77 |
Array, Backtracking |
Medium |
| 156 |
Permutations |
46 |
Array, Backtracking |
Medium |
| 157 |
Permutations II |
47 |
Array, Backtracking |
Medium |
| 158 |
Stone Game |
877 |
Array, Math, Dynamic Programming, Game Theory |
Medium |
| 159 |
Subsets |
78 |
Array, Backtracking, Bit Manipulation |
Medium |
| 160 |
Palindrome Partitioning II |
132 |
String, Dynamic Programming |
Hard |
| 161 |
Combination Sum |
39 |
Array, Backtracking |
Medium |
| 162 |
Combination Sum II |
40 |
Array, Backtracking |
Medium |
| 163 |
Remove Stones to Minimize the Total |
1962 |
Array, Heap (Priority Queue) |
Medium |
| 164 |
Minimum Number of Swaps to Make the String Balanced |
1963 |
Two Pointers, String, Stack, Greedy |
Medium |
| 165 |
Find the Longest Valid Obstacle Course at Each Position |
1964 |
Array, Binary Search, Binary Indexed Tree |
Hard |
| 166 |
Check If String Is a Prefix of Array |
1961 |
Array, String |
Easy |
| 167 |
Add Strings |
415 |
Math, String, Simulation |
Easy |
| 168 |
Largest Number After Mutating Substring |
1946 |
Array, String, Greedy |
Medium |
| 169 |
Flip String to Monotone Increasing |
926 |
String, Dynamic Programming |
Medium |
| 170 |
Array of Doubled Pairs |
954 |
Array, Hash Table, Greedy, Sorting |
Medium |
| 171 |
Group Anagrams |
49 |
Hash Table, String, Sorting |
Medium |
| 172 |
Set Matrix Zeroes |
73 |
Array, Hash Table, Matrix |
Medium |
| 173 |
Word Ladder II |
126 |
Hash Table, String, Backtracking, Breadth-First Search |
Hard |
| 174 |
Remove Boxes |
546 |
Array, Dynamic Programming, Memoization |
Hard |
| 175 |
Array With Elements Not Equal to Average of Neighbors |
1968 |
Array, Greedy, Sorting |
Medium |
| 176 |
Minimum Non-Zero Product of the Array Elements |
1969 |
Math, Greedy, Recursion |
Medium |
| 177 |
Last Day Where You Can Still Cross |
1970 |
Array, Binary Search, Depth-First Search, Breadth-First Search, Union Find, Matrix |
Hard |
| 178 |
Range Sum Query - Immutable |
303 |
Array, Design, Prefix Sum |
Easy |
| 179 |
Minimum Window Substring |
76 |
Hash Table, String, Sliding Window |
Hard |
| 180 |
Count Good Nodes in Binary Tree |
1448 |
Tree, Depth-First Search, Breadth-First Search, Binary Tree |
Medium |
| 181 |
Check if Move is Legal |
1958 |
Array, Matrix, Enumeration |
Medium |
| 182 |
Minimum Total Space Wasted With K Resizing Operations |
1959 |
Array, Dynamic Programming |
Medium |
| 183 |
Delete Characters to Make Fancy String |
1957 |
String |
Easy |
| 184 |
Decode Ways |
91 |
String, Dynamic Programming |
Medium |
| 185 |
Remove Duplicates from Sorted Array |
26 |
Array, Two Pointers |
Easy |
| 186 |
Best Time to Buy and Sell Stock II |
122 |
Array, Dynamic Programming, Greedy |
Medium |
| 187 |
Rotate Array |
189 |
Array, Math, Two Pointers |
Medium |
| 188 |
Contains Duplicate |
217 |
Array, Hash Table, Sorting |
Easy |
| 189 |
Single Number |
136 |
Array, Bit Manipulation |
Easy |
| 190 |
Maximum Product of Splitted Binary Tree |
1339 |
Tree, Depth-First Search, Binary Tree |
Medium |
| 191 |
Intersection of Two Arrays II |
350 |
Array, Hash Table, Two Pointers, Binary Search, Sorting |
Easy |
| 192 |
Intersection of Two Arrays |
349 |
Array, Hash Table, Two Pointers, Binary Search, Sorting |
Easy |
| 193 |
Plus One |
66 |
Array, Math |
Easy |
| 194 |
Move Zeroes |
283 |
Array, Two Pointers |
Easy |
| 195 |
Two Sum |
1 |
Array, Hash Table |
Easy |
| 196 |
Rotate Image |
48 |
Array, Math, Matrix |
Medium |
| 197 |
Valid Sudoku |
36 |
Array, Hash Table, Matrix |
Medium |
| 198 |
Reverse String |
344 |
Two Pointers, String, Recursion |
Easy |
| 199 |
Reverse Integer |
7 |
Math |
Easy |
| 200 |
First Unique Character in a String |
387 |
Hash Table, String, Queue, Counting |
Easy |
| 201 |
Valid Anagram |
242 |
Hash Table, String, Sorting |
Easy |
| 202 |
Valid Palindrome |
125 |
Two Pointers, String |
Easy |
| 203 |
String to Integer (atoi) |
8 |
String |
Medium |
| 204 |
Implement strStr() |
28 |
Two Pointers, String, String Matching |
Easy |
| 205 |
Minimum Time to Type Word Using Special Typewriter |
1974 |
String, Greedy |
Easy |
| 206 |
Maximum Matrix Sum |
1975 |
Array, Greedy, Matrix |
Medium |
| 207 |
Find Greatest Common Divisor of Array |
1979 |
Array, Math |
Easy |
| 208 |
Find Unique Binary String |
1980 |
Array, String, Backtracking |
Medium |
| 209 |
Minimize the Difference Between Target and Chosen Elements |
1981 |
Array, Dynamic Programming, Matrix |
Medium |
| 210 |
Sudoku Solver |
37 |
Array, Backtracking, Matrix |
Hard |
| 211 |
Merge Intervals |
56 |
Array, Sorting |
Medium |
| 212 |
Rectangle Area II |
850 |
Array, Segment Tree, Line Sweep, Ordered Set |
Hard |
| 213 |
Two Sum IV - Input is a BST |
653 |
Hash Table, Two Pointers, Tree, Depth-First Search, Breadth-First Search, Binary Search Tree, Binary Tree |
Easy |
| 214 |
Complex Number Multiplication |
537 |
Math, String, Simulation |
Medium |
| 215 |
Count and Say |
38 |
String |
Medium |
| 216 |
Longest Common Prefix |
14 |
String |
Easy |
| 217 |
Sum of Square Numbers |
633 |
Math, Two Pointers, Binary Search |
Medium |
| 218 |
Delete Node in a Linked List |
237 |
Linked List |
Easy |
| 219 |
Remove Nth Node From End of List |
19 |
Linked List, Two Pointers |
Medium |
| 220 |
Verify Preorder Serialization of a Binary Tree |
331 |
String, Stack, Tree, Binary Tree |
Medium |
| 221 |
Longest Uncommon Subsequence II |
522 |
Array, Hash Table, Two Pointers, String, Sorting |
Medium |
| 222 |
Minimum Difference Between Highest and Lowest of K Scores |
1984 |
Array, Sorting |
Easy |
| 223 |
Find the Kth Largest Integer in the Array |
1985 |
Array, String, Divide and Conquer, Sorting, Heap (Priority Queue), Quickselect |
Medium |
| 224 |
Maximum Profit in Job Scheduling |
1235 |
Array, Binary Search, Dynamic Programming, Sorting |
Hard |
| 225 |
Minimum Number of Work Sessions to Finish the Tasks |
1986 |
Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask |
Medium |
| 226 |
Range Addition II |
598 |
Array, Math |
Easy |
| 227 |
Patching Array |
330 |
Array, Greedy |
Hard |
| 228 |
Merge Two Sorted Lists |
21 |
Linked List, Recursion |
Easy |
| 229 |
Palindrome Linked List |
234 |
Linked List, Two Pointers, Stack, Recursion |
Easy |
| 230 |
Find Minimum in Rotated Sorted Array |
153 |
Array, Binary Search |
Medium |
| 231 |
Linked List Cycle |
141 |
Hash Table, Linked List, Two Pointers |
Easy |
| 232 |
Maximum Depth of Binary Tree |
104 |
Tree, Depth-First Search, Breadth-First Search, Binary Tree |
Easy |
| 233 |
Validate Binary Search Tree |
98 |
Tree, Depth-First Search, Binary Search Tree, Binary Tree |
Medium |
| 234 |
Symmetric Tree |
101 |
Tree, Depth-First Search, Breadth-First Search, Binary Tree |
Easy |
| 235 |
Number of Strings That Appear as Substrings in Word |
1967 |
String |
Easy |
| 236 |
Array Nesting |
565 |
Array, Depth-First Search |
Medium |
| 237 |
Binary Tree Level Order Traversal |
102 |
Tree, Breadth-First Search, Binary Tree |
Medium |
| 238 |
Convert Sorted Array to Binary Search Tree |
108 |
Array, Divide and Conquer, Tree, Binary Search Tree, Binary Tree |
Easy |
| 239 |
Unique Binary Search Trees II |
95 |
Dynamic Programming, Backtracking, Tree, Binary Search Tree, Binary Tree |
Medium |
| 240 |
Merge Sorted Array |
88 |
Array, Two Pointers, Sorting |
Easy |
| 241 |
Sum of Distances in Tree |
834 |
Dynamic Programming, Tree, Depth-First Search, Graph |
Hard |
| 242 |
First Bad Version |
278 |
Binary Search, Interactive |
Easy |
| 243 |
Climbing Stairs |
70 |
Math, Dynamic Programming, Memoization |
Easy |
| 244 |
Best Time to Buy and Sell Stock |
121 |
Array, Dynamic Programming |
Easy |
| 245 |
Maximum Subarray |
53 |
Array, Divide and Conquer, Dynamic Programming |
Easy |
| 246 |
House Robber |
198 |
Array, Dynamic Programming |
Medium |
| 247 |
Shuffle an Array |
384 |
Array, Math, Randomized |
Medium |
| 248 |
Find the Middle Index in Array |
1991 |
Array, Prefix Sum |
Easy |
| 249 |
Find All Groups of Farmland |
1992 |
Array, Depth-First Search, Breadth-First Search, Matrix |
Medium |
| 250 |
Operations on Tree |
1993 |
Hash Table, Tree, Breadth-First Search, Design |
Medium |
| 251 |
Min Stack |
155 |
Stack, Design |
Easy |
| 252 |
Orderly Queue |
899 |
Math, String, Sorting |
Hard |
| 253 |
Slowest Key |
1629 |
Array, String |
Easy |
| 254 |
Reverse Linked List |
206 |
Linked List, Recursion |
Easy |
| 255 |
Fizz Buzz |
412 |
Math, String, Simulation |
Easy |
| 256 |
Count Primes |
204 |
Array, Math, Enumeration, Number Theory |
Easy |
| 257 |
Power of Three |
326 |
Math, Recursion |
Easy |
| 258 |
Shifting Letters |
848 |
Array, String |
Medium |
| 259 |
Roman to Integer |
13 |
Hash Table, Math, String |
Easy |
| 260 |
Number of 1 Bits |
191 |
Bit Manipulation |
Easy |
| 261 |
Hamming Distance |
461 |
Bit Manipulation |
Easy |
| 262 |
Largest Plus Sign |
764 |
Array, Dynamic Programming |
Medium |
| 263 |
Reverse Bits |
190 |
Divide and Conquer, Bit Manipulation |
Easy |
| 264 |
Pascal's Triangle |
118 |
Array, Dynamic Programming |
Easy |
| 265 |
Valid Parentheses |
20 |
String, Stack |
Easy |
| 266 |
Missing Number |
268 |
Array, Hash Table, Math, Bit Manipulation, Sorting |
Easy |
| 267 |
Basic Calculator |
224 |
Math, String, Stack, Recursion |
Hard |
| 268 |
Arithmetic Slices II - Subsequence |
446 |
Array, Dynamic Programming |
Hard |
| 269 |
Number of Pairs of Interchangeable Rectangles |
2001 |
|
Medium |
| 270 |
Smallest Missing Genetic Value in Each Subtree |
2003 |
|
Hard |
| 271 |
Maximum Product of the Length of Two Palindromic Subsequences |
2002 |
|
Medium |
| 272 |
Reverse Prefix of Word |
2000 |
|
Easy |
| 273 |
Count Special Quadruplets |
1995 |
Array, Enumeration |
Easy |
| 274 |
First Day Where You Have Been in All the Rooms |
1997 |
Array, Dynamic Programming |
Medium |
| 275 |
The Number of Weak Characters in the Game |
1996 |
Array, Stack, Greedy, Sorting, Monotonic Stack |
Medium |
| 276 |
Maximum Number of Balloons |
1189 |
Hash Table, String, Counting |
Easy |
| 277 |
Reverse Only Letters |
917 |
Two Pointers, String |
Easy |
| 278 |
Number of Unique Good Subsequences |
1987 |
String, Dynamic Programming |
Hard |
| 279 |
Longest Turbulent Subarray |
978 |
Array, Dynamic Programming, Sliding Window |
Medium |
| 280 |
Spiral Matrix |
54 |
Array, Matrix, Simulation |
Medium |
| 281 |
Expression Add Operators |
282 |
Math, String, Backtracking |
Hard |
| 282 |
Count Number of Pairs With Absolute Difference K |
2006 |
Array |
Easy |
| 283 |
Find Original Array From Doubled Array |
2007 |
Array, Hash Table, Greedy, Sorting |
Medium |
| 284 |
Maximum Earnings From Taxi |
2008 |
Array, Binary Search, Dynamic Programming, Sorting |
Medium |
| 285 |
Minimum Number of Operations to Make Array Continuous |
2009 |
Array, Binary Search |
Hard |
| 286 |
Final Value of Variable After Performing Operations |
2011 |
Array, String, Simulation |
Easy |
| 287 |
Sum of Beauty in the Array |
2012 |
Array |
Medium |
| 288 |
Detect Squares |
2013 |
Array, Hash Table, Design, Counting |
Medium |
| 289 |
Distinct Subsequences |
115 |
String, Dynamic Programming |
Hard |
| 290 |
Find Winner on a Tic Tac Toe Game |
1275 |
Array, Hash Table, Matrix, Simulation |
Easy |
| 291 |
Max Consecutive Ones |
485 |
Array |
Easy |
| 292 |
3Sum |
15 |
Array, Two Pointers, Sorting |
Medium |
| 293 |
Longest Substring Without Repeating Characters |
3 |
Hash Table, String, Sliding Window |
Medium |
| 294 |
Longest Palindromic Substring |
5 |
String, Dynamic Programming |
Medium |
| 295 |
Increasing Triplet Subsequence |
334 |
Array, Greedy |
Medium |
| 296 |
Add Two Numbers |
2 |
Linked List, Math, Recursion |
Medium |
| 297 |
Odd Even Linked List |
328 |
Linked List |
Medium |
| 298 |
Intersection of Two Linked Lists |
160 |
Hash Table, Linked List, Two Pointers |
Easy |
| 299 |
Maximum Length of a Concatenated String with Unique Characters |
1239 |
Array, String, Backtracking, Bit Manipulation |
Medium |
| 300 |
GCD Sort of an Array |
1998 |
Array, Math, Union Find, Sorting |
Hard |
| 301 |
Binary Tree Zigzag Level Order Traversal |
103 |
Tree, Breadth-First Search, Binary Tree |
Medium |
| 302 |
Construct Binary Tree from Preorder and Inorder Traversal |
105 |
Array, Hash Table, Divide and Conquer, Tree, Binary Tree |
Medium |
| 303 |
Kth Smallest Element in a BST |
230 |
Tree, Depth-First Search, Binary Search Tree, Binary Tree |
Medium |
| 304 |
Binary Tree Inorder Traversal |
94 |
Stack, Tree, Depth-First Search, Binary Tree |
Easy |
| 305 |
Number of Islands |
200 |
Array, Depth-First Search, Breadth-First Search, Union Find, Matrix |
Medium |
| 306 |
Letter Combinations of a Phone Number |
17 |
Hash Table, String, Backtracking |
Medium |
| 307 |
Generate Parentheses |
22 |
String, Dynamic Programming, Backtracking |
Medium |
| 308 |
Word Search |
79 |
Array, Backtracking, Matrix |
Medium |
| 309 |
Break a Palindrome |
1328 |
String, Greedy |
Medium |
| 310 |
N-th Tribonacci Number |
1137 |
Math, Dynamic Programming, Memoization |
Easy |
| 311 |
Sort Colors |
75 |
Array, Two Pointers, Sorting |
Medium |
| 312 |
Top K Frequent Elements |
347 |
Array, Hash Table, Divide and Conquer, Sorting, Heap (Priority Queue), Bucket Sort, Counting, Quickselect |
Medium |
| 313 |
Shortest Path in a Grid with Obstacles Elimination |
1293 |
Array, Breadth-First Search, Matrix |
Hard |
| 314 |
Maximum Difference Between Increasing Elements |
2016 |
Array |
Easy |
| 315 |
Grid Game |
2017 |
Array, Matrix, Prefix Sum |
Medium |
| 316 |
Check if Word Can Be Placed In Crossword |
2018 |
Array, Matrix, Enumeration |
Medium |
| 317 |
Unique Email Addresses |
929 |
Array, Hash Table, String |
Easy |
| 318 |
Sort Array By Parity II |
922 |
Array, Two Pointers, Sorting |
Easy |
| 319 |
Partition to K Equal Sum Subsets |
698 |
Array, Dynamic Programming, Backtracking, Bit Manipulation, Memoization, Bitmask |
Medium |
| 320 |
Split Linked List in Parts |
725 |
Linked List |
Medium |
| 321 |
Longest Common Subsequence |
1143 |
String, Dynamic Programming |
Medium |
| 322 |
Jump Game |
55 |
Array, Dynamic Programming, Greedy |
Medium |
| 323 |
Dungeon Game |
174 |
Array, Dynamic Programming, Matrix |
Hard |
| 324 |
Minimum Moves to Convert String |
2027 |
|
Easy |
| 325 |
Find Missing Observations |
2028 |
|
Medium |
| 326 |
Stone Game IX |
2029 |
|
Medium |
| 327 |
Subtree of Another Tree |
572 |
Tree, Depth-First Search, String Matching, Binary Tree, Hash Function |
Easy |
| 328 |
Island Perimeter |
463 |
Array, Depth-First Search, Breadth-First Search, Matrix |
Easy |
| 329 |
Longest Subsequence Repeated k Times |
2014 |
String, Backtracking, Greedy, Counting, Enumeration |
Hard |
| 330 |
Find All Duplicates in an Array |
442 |
Array, Hash Table |
Medium |
| 331 |
Kth Largest Element in an Array |
215 |
Array, Divide and Conquer, Sorting, Heap (Priority Queue), Quickselect |
Medium |
| 332 |
Implement Trie (Prefix Tree) |
208 |
Hash Table, String, Design, Trie |
Medium |
| 333 |
Find First and Last Position of Element in Sorted Array |
34 |
Array, Binary Search |
Medium |
| 334 |
Search in Rotated Sorted Array |
33 |
Array, Binary Search |
Medium |
| 335 |
Convert 1D Array Into 2D Array |
2022 |
Array, Matrix, Simulation |
Easy |
| 336 |
Number of Pairs of Strings With Concatenation Equal to Target |
2023 |
Array, String |
Medium |
| 337 |
Maximize the Confusion of an Exam |
2024 |
String, Binary Search, Sliding Window, Prefix Sum |
Medium |
| 338 |
Max Consecutive Ones III |
1004 |
Array, Binary Search, Sliding Window, Prefix Sum |
Medium |
| 339 |
Longest Repeating Character Replacement |
424 |
Hash Table, String, Sliding Window |
Medium |
| 340 |
Maximum Number of Ways to Partition an Array |
2025 |
Array, Hash Table, Counting, Enumeration, Prefix Sum |
Hard |
| 341 |
Word Search II |
212 |
Array, String, Backtracking, Trie, Matrix |
Hard |
| 342 |
Two Out of Three |
2032 |
Array, Hash Table |
Easy |
| 343 |
Minimum Operations to Make a Uni-Value Grid |
2033 |
Array, Math, Sorting, Matrix |
Medium |
| 344 |
Stock Price Fluctuation |
2034 |
Hash Table, Design, Heap (Priority Queue), Ordered Set |
Medium |
| 345 |
Partition Array Into Two Arrays to Minimize Sum Difference |
2035 |
Array, Two Pointers, Binary Search, Dynamic Programming, Bit Manipulation, Ordered Set, Bitmask |
Hard |
| 346 |
Diameter of Binary Tree |
543 |
Tree, Depth-First Search, Binary Tree |
Easy |
| 347 |
Bitwise AND of Numbers Range |
201 |
Bit Manipulation |
Medium |
| 348 |
Search a 2D Matrix II |
240 |
Array, Binary Search, Divide and Conquer, Matrix |
Medium |
| 349 |
Guess Number Higher or Lower |
374 |
Binary Search, Interactive |
Easy |
| 350 |
Unique Paths |
62 |
Math, Dynamic Programming, Combinatorics |
Medium |
| 351 |
Coin Change |
322 |
Array, Dynamic Programming, Breadth-First Search |
Medium |
| 352 |
Construct Binary Search Tree from Preorder Traversal |
1008 |
Array, Stack, Tree, Binary Search Tree, Monotonic Stack, Binary Tree |
Medium |
| 353 |
Perfect Squares |
279 |
Math, Dynamic Programming, Breadth-First Search |
Medium |
| 354 |
Best Time to Buy and Sell Stock with Cooldown |
309 |
Array, Dynamic Programming |
Medium |
| 355 |
Minimum Number of Moves to Seat Everyone |
2037 |
Array, Sorting |
Easy |
| 356 |
Remove Colored Pieces if Both Neighbors are the Same Color |
2038 |
Math, String, Greedy, Game Theory |
Medium |
| 357 |
The Time When the Network Becomes Idle |
2039 |
Array, Breadth-First Search, Graph |
Medium |
| 358 |
Check if Numbers Are Ascending in a Sentence |
2042 |
String |
Easy |
| 359 |
Simple Bank System |
2043 |
Array, Hash Table, Design, Simulation |
Medium |
| 360 |
Count Number of Maximum Bitwise-OR Subsets |
2044 |
Array, Backtracking, Bit Manipulation |
Medium |
| 361 |
Second Minimum Time to Reach Destination |
2045 |
Array, Breadth-First Search, Graph, Shortest Path |
Hard |
| 362 |
Path Sum III |
437 |
Tree, Depth-First Search, Binary Tree |
Medium |
| 363 |
Cousins in Binary Tree |
993 |
Tree, Depth-First Search, Breadth-First Search, Binary Tree |
Easy |
| 364 |
Best Time to Buy and Sell Stock III |
123 |
Array, Dynamic Programming |
Hard |
| 365 |
Happy Number |
202 |
Hash Table, Math, Two Pointers |
Easy |
| 366 |
Factorial Trailing Zeroes |
172 |
Math |
Medium |
| 367 |
Excel Sheet Column Number |
171 |
Math, String |
Easy |
| 368 |
Pow(x, n) |
50 |
Math, Recursion |
Medium |
| 369 |
Sqrt(x) |
69 |
Math, Binary Search |
Easy |
| 370 |
Next Greater Element I |
496 |
Array, Hash Table, Stack, Monotonic Stack |
Easy |
| 371 |
Sum of Two Integers |
371 |
Math, Bit Manipulation |
Medium |
| 372 |
Reverse Words in a String |
151 |
Two Pointers, String |
Medium |
| 373 |
Insert Delete GetRandom O(1) |
380 |
Array, Hash Table, Math, Design, Randomized |
Medium |
| 374 |
Evaluate Reverse Polish Notation |
150 |
Array, Math, Stack |
Medium |
| 375 |
Majority Element |
169 |
Array, Hash Table, Divide and Conquer, Sorting, Counting |
Easy |
| 376 |
Sort Characters By Frequency |
451 |
Hash Table, String, Sorting, Heap (Priority Queue), Bucket Sort, Counting |
Medium |
| 377 |
Task Scheduler |
621 |
Array, Hash Table, Greedy, Sorting, Heap (Priority Queue), Counting |
Medium |
| 378 |
Find Minimum in Rotated Sorted Array II |
154 |
Array, Binary Search |
Hard |
| 379 |
Number of Valid Words in a Sentence |
2047 |
|
Easy |
| 380 |
Next Greater Numerically Balanced Number |
2048 |
|
Medium |
| 381 |
Count Nodes With the Highest Score |
2049 |
|
Medium |
| 382 |
Parallel Courses III |
2050 |
|
Hard |
| 383 |
Count Complete Tree Nodes |
222 |
Binary Search, Tree, Depth-First Search, Binary Tree |
Medium |
| 384 |
Invert Binary Tree |
226 |
Tree, Depth-First Search, Breadth-First Search, Binary Tree |
Easy |
| 385 |
Network Delay Time |
743 |
Depth-First Search, Breadth-First Search, Graph, Heap (Priority Queue), Shortest Path |
Medium |
| 386 |
Path with Maximum Probability |
1514 |
Graph, Heap (Priority Queue), Shortest Path |
Medium |
| 387 |
Path With Minimum Effort |
1631 |
Array, Binary Search, Depth-First Search, Breadth-First Search, Union Find, Heap (Priority Queue), Matrix |
Medium |
| 388 |
Rotting Oranges |
994 |
Array, Breadth-First Search, Matrix |
Medium |
| 389 |
Smallest Index With Equal Value |
2057 |
Array |
Easy |
| 390 |
Find the Minimum and Maximum Number of Nodes Between Critical Points |
2058 |
Linked List |
Medium |
| 391 |
Minimum Operations to Convert Number |
2059 |
Array, Breadth-First Search |
Medium |
| 392 |
Surrounded Regions |
130 |
Array, Depth-First Search, Breadth-First Search, Union Find, Matrix |
Medium |
| 393 |
Sum Root to Leaf Numbers |
129 |
Tree, Depth-First Search, Binary Tree |
Medium |
| 394 |
Sum of Left Leaves |
404 |
Tree, Depth-First Search, Breadth-First Search, Binary Tree |
Easy |
| 395 |
Arranging Coins |
441 |
Math, Binary Search |
Easy |
| 396 |
Kth Distinct String in an Array |
2053 |
Array, Hash Table, String, Counting |
Easy |
| 397 |
Two Best Non-Overlapping Events |
2054 |
Array, Binary Search, Dynamic Programming, Sorting, Heap (Priority Queue) |
Medium |
| 398 |
Plates Between Candles |
2055 |
Array, String, Binary Search, Prefix Sum |
Medium |
| 399 |
Single Number III |
260 |
Array, Bit Manipulation |
Medium |
| 400 |
Vowels of All Substrings |
2063 |
Math, String, Dynamic Programming, Combinatorics |
Medium |
| 401 |
Minimized Maximum of Products Distributed to Any Store |
2064 |
Array, Binary Search |
Medium |
| 402 |
Multiply Strings |
43 |
Math, String, Simulation |
Medium |
| 403 |
Maximum Path Quality of a Graph |
2065 |
Array, Backtracking, Graph |
Hard |
| 404 |
Unique Binary Search Trees |
96 |
Math, Dynamic Programming, Tree, Binary Search Tree, Binary Tree |
Medium |
| 405 |
Number of Valid Words for Each Puzzle |
1178 |
Array, Hash Table, String, Bit Manipulation, Trie |
Hard |
| 406 |
Minimum Value to Get Positive Step by Step Sum |
1413 |
Array, Prefix Sum |
Easy |
| 407 |
First Missing Positive |
41 |
Array, Hash Table |
Hard |
| 408 |
Remove Linked List Elements |
203 |
Linked List, Recursion |
Easy |
| 409 |
Daily Temperatures |
739 |
Array, Stack, Monotonic Stack |
Medium |
| 410 |
Guess the Word |
843 |
Array, Math, String, Interactive, Game Theory |
Hard |
| 411 |
Check Whether Two Strings are Almost Equivalent |
2068 |
Hash Table, String, Counting |
Easy |
| 412 |
Most Beautiful Item for Each Query |
2070 |
Array, Binary Search, Sorting |
Medium |
| 413 |
Walking Robot Simulation II |
2069 |
Design, Simulation |
Medium |
| 414 |
Time Needed to Buy Tickets |
2073 |
Array, Queue, Simulation |
Easy |
| 415 |
Reverse Nodes in Even Length Groups |
2074 |
Linked List |
Medium |
| 416 |
Decode the Slanted Ciphertext |
2075 |
String, Simulation |
Medium |
| 417 |
Process Restricted Friend Requests |
2076 |
Union Find, Graph |
Hard |
| 418 |
Iterator for Combination |
1286 |
String, Backtracking, Design, Iterator |
Medium |
| 419 |
Expressive Words |
809 |
Array, Two Pointers, String |
Medium |
| 420 |
Validate Stack Sequences |
946 |
Array, Stack, Simulation |
Medium |
| 421 |
Largest Divisible Subset |
368 |
Array, Math, Dynamic Programming, Sorting |
Medium |
| 422 |
Redundant Connection |
684 |
Depth-First Search, Breadth-First Search, Union Find, Graph |
Medium |
| 423 |
Kth Smallest Number in Multiplication Table |
668 |
Binary Search |
Hard |
| 424 |
Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit |
1438 |
Array, Queue, Sliding Window, Heap (Priority Queue), Ordered Set, Monotonic Queue |
Medium |
| 425 |
Find All Numbers Disappeared in an Array |
448 |
Array, Hash Table |
Easy |
| 426 |
Delete Nodes And Return Forest |
1110 |
Tree, Depth-First Search, Binary Tree |
Medium |
| 427 |
Text Justification |
68 |
Array, String, Simulation |
Hard |
| 428 |
Single Element in a Sorted Array |
540 |
Array, Binary Search |
Medium |
| 429 |
Logger Rate Limiter |
359 |
Hash Table, Design |
Easy |
| 430 |
Find Leaves of Binary Tree |
366 |
Tree, Depth-First Search, Binary Tree |
Medium |
| 431 |
Construct Binary Tree from Inorder and Postorder Traversal |
106 |
Array, Hash Table, Divide and Conquer, Tree, Binary Tree |
Medium |
| 432 |
Two Furthest Houses With Different Colors |
2078 |
|
Easy |
| 433 |
Watering Plants |
2079 |
Array |
Medium |
| 434 |
Sum of k-Mirror Numbers |
2081 |
|
Hard |
| 435 |
Range Frequency Queries |
2080 |
Array, Binary Search |
Medium |
| 436 |
Longest Absolute File Path |
388 |
String, Stack, Depth-First Search |
Medium |
| 437 |
Decode String |
394 |
String, Stack, Recursion |
Medium |
| 438 |
Delete Node in a BST |
450 |
Tree, Binary Search Tree, Binary Tree |
Medium |
| 439 |
Count Vowel Substrings of a String |
2062 |
Hash Table, String |
Easy |