| β
|
001 |
Two Sum |
Source |
Easy |
| β
|
002 |
Add Two Numbers |
Source |
Medium |
| β
|
003 |
Longest Substring Without Repeating Characters |
Source |
Medium |
|
004 |
Median of Two Sorted Arrays |
|
Hard |
|
005 |
Longest Palindromic Substring |
|
Medium |
| β
|
006 |
ZigZag Conversion |
Source |
Medium |
| β
|
007 |
Reverse Integer |
Source |
Easy |
| β
|
008 |
String to Integer (atoi) |
Source |
Medium |
| β
|
009 |
Palindrome Number |
Source |
Easy |
|
010 |
Regular Expression Matching |
|
Hard |
| β
|
011 |
Container With Most Water |
Source |
Medium |
| β
|
012 |
Integer to Roman |
Source |
Medium |
|
013 |
Roman to Integer |
|
Easy |
| β
|
014 |
Longest Common Prefix |
Source |
Easy |
|
015 |
3Sum |
|
Medium |
|
016 |
3Sum Closest |
|
Medium |
|
017 |
Letter Combinations of a Phone Number |
|
Medium |
|
018 |
4Sum |
|
Medium |
| β
|
019 |
Remove Nth Node From End of List |
Source |
Medium |
| β
|
020 |
Valid Parentheses |
Source |
Easy |
| β
|
021 |
Merge Two Sorted Lists |
Source |
Easy |
|
022 |
Generate Parentheses |
|
Medium |
|
023 |
Merge k Sorted Lists |
|
Hard |
| β
|
024 |
Swap Nodes in Pairs |
Source |
Medium |
|
025 |
Reverse Nodes in k-Group |
|
Hard |
| β
|
026 |
Remove Duplicates from Sorted Array |
Source |
Easy |
| β
|
027 |
Remove Element |
Source |
Easy |
|
028 |
Implement strStr() |
|
Easy |
|
029 |
Divide Two Integers |
|
Medium |
|
030 |
Substring with Concatenation of All Words |
|
Hard |
|
031 |
Next Permutation |
|
Medium |
|
032 |
Longest Valid Parentheses |
|
Hard |
|
033 |
Search in Rotated Sorted Array |
|
Medium |
|
034 |
Search for a Range |
|
Medium |
| β
|
035 |
Search Insert Position |
Source |
Easy |
| β
|
036 |
Valid Sudoku |
Source |
Medium |
|
037 |
Sudoku Solver |
|
Hard |
|
038 |
Count and Say |
|
Easy |
|
039 |
Combination Sum |
|
Medium |
|
040 |
Combination Sum II |
|
Medium |
|
041 |
First Missing Positive |
|
Hard |
|
042 |
Trapping Rain Water |
|
Hard |
|
043 |
Multiply Strings |
|
Medium |
|
044 |
Wildcard Matching |
|
Hard |
|
045 |
Jump Game II |
|
Hard |
|
046 |
Permutations |
|
Medium |
|
047 |
Permutations II |
|
Medium |
| β
|
048 |
Rotate Image |
Source |
Medium |
|
049 |
Group Anagrams |
|
Medium |
| β
|
050 |
Pow(x, n) |
Source |
Medium |
|
051 |
N-Queens |
|
Hard |
|
052 |
N-Queens II |
|
Hard |
| β
|
053 |
Maximum Subarray |
Source |
Easy |
|
054 |
Spiral Matrix |
|
Medium |
|
055 |
Jump Game |
|
Medium |
|
056 |
Merge Intervals |
|
Medium |
|
057 |
Insert Interval |
|
Hard |
| β
|
058 |
Length of Last Word |
Source |
Easy |
| β
|
059 |
Spiral Matrix II |
Source |
Medium |
|
060 |
Permutation Sequence |
|
Medium |
|
061 |
Rotate List |
|
Medium |
| β
|
062 |
Unique Paths |
Source |
Medium |
|
063 |
Unique Paths II |
|
Medium |
| β
|
064 |
Minimum Path Sum |
Source |
Medium |
|
065 |
Valid Number |
|
Hard |
| β
|
066 |
Plus One |
Source |
Easy |
| β
|
067 |
Add Binary |
Source |
Easy |
|
068 |
Text Justification |
|
Hard |
| β
|
069 |
Sqrt(x) |
Source |
Easy |
| β
|
070 |
Climbing Stairs |
Source |
Easy |
|
071 |
Simplify Path |
|
Medium |
|
072 |
Edit Distance |
|
Hard |
| β
|
073 |
Set Matrix Zeroes |
Source |
Medium |
|
074 |
Search a 2D Matrix |
|
Medium |
| β
|
075 |
Sort Colors |
Source |
Medium |
|
076 |
Minimum Window Substring |
|
Hard |
|
077 |
Combinations |
|
Medium |
|
078 |
Subsets |
|
Medium |
|
079 |
Word Search |
|
Medium |
| β
|
080 |
Remove Duplicates from Sorted Array II |
Source |
Medium |
|
081 |
Search in Rotated Sorted Array II |
|
Medium |
| β
|
082 |
Remove Duplicates from Sorted List II |
Source |
Medium |
| β
|
083 |
Remove Duplicates from Sorted List |
Source |
Easy |
|
084 |
Largest Rectangle in Histogram |
|
Hard |
|
085 |
Maximal Rectangle |
|
Hard |
| β
|
086 |
Partition List |
Source |
Medium |
|
087 |
Scramble String |
|
Hard |
| β
|
088 |
Merge Sorted Array |
Source |
Easy |
|
089 |
Gray Code |
|
Medium |
|
090 |
Subsets II |
|
Medium |
|
091 |
Decode Ways |
|
Medium |
| β
|
092 |
Reverse Linked List II |
Source |
Medium |
|
093 |
Restore IP Addresses |
|
Medium |
| β
|
094 |
Binary Tree Inorder Traversal |
Source |
Medium |
|
095 |
Unique Binary Search Trees II |
|
Medium |
| β
|
096 |
Unique Binary Search Trees |
Source |
Medium |
|
097 |
Interleaving String |
|
Hard |
| β
|
098 |
Validate Binary Search Tree |
Source |
Medium |
|
099 |
Recover Binary Search Tree |
|
Hard |
| β
|
100 |
Same Tree |
Source |
Easy |
| β
|
101 |
Symmetric Tree |
Source |
Easy |
| β
|
102 |
Binary Tree Level Order Traversal |
Source |
Medium |
|
103 |
Binary Tree Zigzag Level Order Traversal |
|
Medium |
| β
|
104 |
Maximum Depth of Binary Tree |
Source |
Easy |
|
105 |
Construct Binary Tree from Preorder and Inorder Traversal |
|
Medium |
|
106 |
Construct Binary Tree from Inorder and Postorder Traversal |
|
Medium |
| β
|
107 |
Binary Tree Level Order Traversal II |
Source |
Easy |
| β
|
108 |
Convert Sorted Array to Binary Search Tree |
Source |
Easy |
|
109 |
Convert Sorted List to Binary Search Tree |
|
Medium |
| β
|
110 |
Balanced Binary Tree |
Source |
Easy |
| β
|
111 |
Minimum Depth of Binary Tree |
Source |
Easy |
| β
|
112 |
Path Sum |
Source |
Easy |
|
113 |
Path Sum II |
|
Medium |
| β
|
114 |
Flatten Binary Tree to Linked List |
Source |
Medium |
|
115 |
Distinct Subsequences |
|
Hard |
|
116 |
Populating Next Right Pointers in Each Node |
|
Medium |
|
117 |
Populating Next Right Pointers in Each Node II |
|
Medium |
| β
|
118 |
Pascal's Triangle |
Source |
Easy |
| β
|
119 |
Pascal's Triangle II |
Source |
Easy |
|
120 |
Triangle |
|
Medium |
| β
|
121 |
Best Time to Buy and Sell Stock |
Source |
Easy |
| β
|
122 |
Best Time to Buy and Sell Stock II |
Source |
Easy |
|
123 |
Best Time to Buy and Sell Stock III |
|
Hard |
|
124 |
Binary Tree Maximum Path Sum |
|
Hard |
| β
|
125 |
Valid Palindrome |
Source |
Easy |
|
126 |
Word Ladder II |
|
Hard |
|
127 |
Word Ladder |
|
Medium |
|
128 |
Longest Consecutive Sequence |
|
Hard |
| β
|
129 |
Sum Root to Leaf Numbers |
Source |
Medium |
|
130 |
Surrounded Regions |
|
Medium |
|
131 |
Palindrome Partitioning |
|
Medium |
|
132 |
Palindrome Partitioning II |
|
Hard |
|
133 |
Clone Graph |
|
Medium |
|
134 |
Gas Station |
|
Medium |
|
135 |
Candy |
|
Hard |
| β
|
136 |
Single Number |
Source |
Easy |
| β
|
137 |
Single Number II |
Source |
Medium |
|
138 |
Copy List with Random Pointer |
|
Medium |
|
139 |
Word Break |
|
Medium |
|
140 |
Word Break II |
|
Hard |
| β
|
141 |
Linked List Cycle |
Source |
Easy |
| β
|
142 |
Linked List Cycle II |
Source |
Medium |
|
143 |
Reorder List |
|
Medium |
| β
|
144 |
Binary Tree Preorder Traversal |
Source |
Medium |
|
145 |
Binary Tree Postorder Traversal |
|
Hard |
|
146 |
LRU Cache |
|
Hard |
|
147 |
Insertion Sort List |
|
Medium |
|
148 |
Sort List |
|
Medium |
|
149 |
Max Points on a Line |
|
Hard |
|
150 |
Evaluate Reverse Polish Notation |
|
Medium |
|
151 |
Reverse Words in a String |
|
Medium |
|
152 |
Maximum Product Subarray |
|
Medium |
| β
|
153 |
Find Minimum in Rotated Sorted Array |
Source |
Medium |
| β
|
154 |
Find Minimum in Rotated Sorted Array II |
Source |
Hard |
| β
|
155 |
Min Stack |
Source |
Easy |
|
156 |
Binary Tree Upside Down π |
|
Medium |
|
157 |
Read N Characters Given Read4 π |
|
Easy |
|
158 |
Read N Characters Given Read4 II - Call multiple times π |
|
Hard |
|
159 |
Longest Substring with At Most Two Distinct Characters π |
|
Hard |
| β
|
160 |
Intersection of Two Linked Lists |
Source |
Easy |
|
161 |
One Edit Distance π |
|
Medium |
|
162 |
Find Peak Element |
|
Medium |
|
163 |
Missing Ranges π |
|
Medium |
|
164 |
Maximum Gap |
|
Hard |
| β
|
165 |
Compare Version Numbers |
Source |
Medium |
|
166 |
Fraction to Recurring Decimal |
|
Medium |
|
167 |
Two Sum II - Input array is sorted |
|
Easy |
| β
|
168 |
Excel Sheet Column Title |
Source |
Easy |
| β
|
169 |
Majority Element |
Source |
Easy |
|
170 |
Two Sum III - Data structure design π |
|
Easy |
| β
|
171 |
Excel Sheet Column Number |
Source |
Easy |
| β
|
172 |
Factorial Trailing Zeroes |
Source |
Easy |
| β
|
173 |
Binary Search Tree Iterator |
Source |
Medium |
|
174 |
Dungeon Game |
|
Hard |
|
179 |
Largest Number |
|
Medium |
|
186 |
Reverse Words in a String II π |
|
Medium |
|
187 |
Repeated DNA Sequences |
|
Medium |
|
188 |
Best Time to Buy and Sell Stock IV |
|
Hard |
| β
|
189 |
Rotate Array |
Source |
Easy |
| β
|
190 |
Reverse Bits |
Source |
Easy |
| β
|
191 |
Number of 1 Bits |
Source |
Easy |
| β
|
198 |
House Robber |
Source |
Easy |
| β
|
199 |
Binary Tree Right Side View |
Source |
Medium |
|
200 |
Number of Islands |
|
Medium |
| β
|
201 |
Bitwise AND of Numbers Range |
Source |
Medium |
| β
|
202 |
Happy Number |
Source |
Easy |
| β
|
203 |
Remove Linked List Elements |
Source |
Easy |
| β
|
204 |
Count Primes |
Source |
Easy |
| β
|
205 |
Isomorphic Strings |
Source |
Easy |
| β
|
206 |
Reverse Linked List |
Source |
Easy |
|
207 |
Course Schedule |
|
Medium |
|
208 |
Implement Trie (Prefix Tree) |
|
Medium |
|
209 |
Minimum Size Subarray Sum |
|
Medium |
|
210 |
Course Schedule II |
|
Medium |
|
211 |
Add and Search Word - Data structure design |
|
Medium |
|
212 |
Word Search II |
|
Hard |
|
213 |
House Robber II |
|
Medium |
|
214 |
Shortest Palindrome |
|
Hard |
|
215 |
Kth Largest Element in an Array |
|
Medium |
|
216 |
Combination Sum III |
|
Medium |
| β
|
217 |
Contains Duplicate |
Source |
Easy |
|
218 |
The Skyline Problem |
|
Hard |
| β
|
219 |
Contains Duplicate II |
Source |
Easy |
|
220 |
Contains Duplicate III |
|
Medium |
|
221 |
Maximal Square |
|
Medium |
|
222 |
Count Complete Tree Nodes |
|
Medium |
| β
|
223 |
Rectangle Area |
Source |
Medium |
|
224 |
Basic Calculator |
|
Hard |
| β
|
225 |
Implement Stack using Queues |
Source |
Easy |
| β
|
226 |
Invert Binary Tree |
Source |
Easy |
|
227 |
Basic Calculator II |
|
Medium |
|
228 |
Summary Ranges |
|
Medium |
|
229 |
Majority Element II |
|
Medium |
| β
|
230 |
Kth Smallest Element in a BST |
Source |
Medium |
| β
|
231 |
Power of Two |
Source |
Easy |
| β
|
232 |
Implement Queue using Stacks |
Source |
Easy |
|
233 |
Number of Digit One |
|
Hard |
| β
|
234 |
Palindrome Linked List |
Source |
Easy |
| β
|
235 |
Lowest Common Ancestor of a Binary Search Tree |
Source |
Easy |
|
236 |
Lowest Common Ancestor of a Binary Tree |
|
Medium |
| β
|
237 |
Delete Node in a Linked List |
Source |
Easy |
| β
|
238 |
Product of Array Except Self |
Source |
Medium |
|
239 |
Sliding Window Maximum |
|
Hard |
|
240 |
Search a 2D Matrix II |
|
Medium |
|
241 |
Different Ways to Add Parentheses |
|
Medium |
| β
|
242 |
Valid Anagram |
Source |
Easy |
|
243 |
Shortest Word Distance π |
|
Easy |
|
244 |
Shortest Word Distance II π |
|
Medium |
|
245 |
Shortest Word Distance III π |
|
Medium |
|
246 |
Strobogrammatic Number π |
|
Easy |
|
247 |
Strobogrammatic Number II π |
|
Medium |
|
248 |
Strobogrammatic Number III π |
|
Hard |
|
249 |
Group Shifted Strings π |
|
Medium |
|
250 |
Count Univalue Subtrees π |
|
Medium |
|
251 |
Flatten 2D Vector π |
|
Medium |
|
252 |
Meeting Rooms π |
|
Easy |
|
253 |
Meeting Rooms II π |
|
Medium |
|
254 |
Factor Combinations π |
|
Medium |
|
255 |
Verify Preorder Sequence in Binary Search Tree π |
|
Medium |
|
256 |
Paint House π |
|
Easy |
| β
|
257 |
Binary Tree Paths |
Source |
Easy |
| β
|
258 |
Add Digits |
Source |
Easy |
|
259 |
3Sum Smaller π |
|
Medium |
| β
|
260 |
Single Number III |
Source |
Medium |
|
261 |
Graph Valid Tree π |
|
Medium |
| β
|
263 |
Ugly Number |
Source |
Easy |
|
264 |
Ugly Number II |
|
Medium |
|
265 |
Paint House II π |
|
Hard |
|
266 |
Palindrome Permutation π |
|
Easy |
|
267 |
Palindrome Permutation II π |
|
Medium |
| β
|
268 |
Missing Number |
Source |
Easy |
|
269 |
Alien Dictionary π |
|
Hard |
|
270 |
Closest Binary Search Tree Value π |
|
Easy |
|
271 |
Encode and Decode Strings π |
|
Medium |
|
272 |
Closest Binary Search Tree Value II π |
|
Hard |
|
273 |
Integer to English Words |
|
Hard |
|
274 |
H-Index |
|
Medium |
|
275 |
H-Index II |
|
Medium |
|
276 |
Paint Fence π |
|
Easy |
|
277 |
Find the Celebrity π |
|
Medium |
| β
|
278 |
First Bad Version |
Source |
Easy |
| β
|
279 |
Perfect Squares |
Source |
Medium |
|
280 |
Wiggle Sort π |
|
Medium |
|
281 |
Zigzag Iterator π |
|
Medium |
|
282 |
Expression Add Operators |
|
Hard |
| β
|
283 |
Move Zeroes |
Source |
Easy |
|
284 |
Peeking Iterator |
|
Medium |
|
285 |
Inorder Successor in BST π |
|
Medium |
|
286 |
Walls and Gates π |
|
Medium |
|
287 |
Find the Duplicate Number |
|
Medium |
|
288 |
Unique Word Abbreviation π |
|
Medium |
|
289 |
Game of Life |
|
Medium |
| β
|
290 |
Word Pattern |
Source |
Easy |
|
291 |
Word Pattern II π |
|
Hard |
| β
|
292 |
Nim Game |
Source |
Easy |
|
293 |
Flip Game π |
|
Easy |
|
294 |
Flip Game II π |
|
Medium |
|
295 |
Find Median from Data Stream |
|
Hard |
|
296 |
Best Meeting Point π |
|
Hard |
|
297 |
Serialize and Deserialize Binary Tree |
|
Hard |
|
298 |
Binary Tree Longest Consecutive Sequence π |
|
Medium |
| β
|
299 |
Bulls and Cows |
Source |
Medium |
|
300 |
Longest Increasing Subsequence |
|
Medium |
|
301 |
Remove Invalid Parentheses |
|
Hard |
|
302 |
Smallest Rectangle Enclosing Black Pixels π |
|
Hard |
| β
|
303 |
Range Sum Query - Immutable |
Source |
Easy |
|
304 |
Range Sum Query 2D - Immutable |
|
Medium |
|
305 |
Number of Islands II π |
|
Hard |
|
306 |
Additive Number |
|
Medium |
|
307 |
Range Sum Query - Mutable |
|
Medium |
|
308 |
Range Sum Query 2D - Mutable π |
|
Hard |
|
309 |
Best Time to Buy and Sell Stock with Cooldown |
|
Medium |
|
310 |
Minimum Height Trees |
|
Medium |
|
311 |
Sparse Matrix Multiplication π |
|
Medium |
|
312 |
Burst Balloons |
|
Hard |
|
313 |
Super Ugly Number |
|
Medium |
|
314 |
Binary Tree Vertical Order Traversal π |
|
Medium |
|
315 |
Count of Smaller Numbers After Self |
|
Hard |
|
316 |
Remove Duplicate Letters |
|
Hard |
|
317 |
Shortest Distance from All Buildings π |
|
Hard |
| β
|
318 |
Maximum Product of Word Lengths |
Source |
Medium |
|
319 |
Bulb Switcher |
|
Medium |
|
320 |
Generalized Abbreviation π |
|
Medium |
|
321 |
Create Maximum Number |
|
Hard |
|
322 |
Coin Change |
|
Medium |
|
323 |
Number of Connected Components in an Undirected Graph π |
|
Medium |
|
324 |
Wiggle Sort II |
|
Medium |
|
325 |
Maximum Size Subarray Sum Equals k π |
|
Medium |
| β
|
326 |
Power of Three |
Source |
Easy |
|
327 |
Count of Range Sum |
|
Hard |
| β
|
328 |
Odd Even Linked List |
Source |
Medium |
|
329 |
Longest Increasing Path in a Matrix |
|
Hard |
|
330 |
Patching Array |
|
Hard |
|
331 |
Verify Preorder Serialization of a Binary Tree |
|
Medium |
|
332 |
Reconstruct Itinerary |
|
Medium |
|
333 |
Largest BST Subtree π |
|
Medium |
|
334 |
Increasing Triplet Subsequence |
|
Medium |
|
335 |
Self Crossing |
|
Hard |
|
336 |
Palindrome Pairs |
|
Hard |
|
337 |
House Robber III |
|
Medium |
| β
|
338 |
Counting Bits |
Source |
Medium |
|
339 |
Nested List Weight Sum π |
|
Easy |
|
340 |
Longest Substring with At Most K Distinct Characters π |
|
Hard |
|
341 |
Flatten Nested List Iterator |
|
Medium |
| β
|
342 |
Power of Four |
Source |
Easy |
| β
|
343 |
Integer Break |
Source |
Medium |
| β
|
344 |
Reverse String |
Source |
Easy |
| β
|
345 |
Reverse Vowels of a String |
Source |
Easy |
|
346 |
Moving Average from Data Stream π |
|
Easy |
| β
|
347 |
Top K Frequent Elements |
Source |
Medium |
|
348 |
Design Tic-Tac-Toe π |
|
Medium |
| β
|
349 |
Intersection of Two Arrays |
Source |
Easy |
| β
|
350 |
Intersection of Two Arrays II |
Source |
Easy |
|
351 |
Android Unlock Patterns π |
|
Medium |
|
352 |
Data Stream as Disjoint Intervals |
|
Hard |
|
353 |
Design Snake Game π |
|
Medium |
|
354 |
Russian Doll Envelopes |
|
Hard |
|
355 |
Design Twitter |
|
Medium |
|
356 |
Line Reflection π |
|
Medium |
| β
|
357 |
Count Numbers with Unique Digits |
Source |
Medium |
|
358 |
Rearrange String k Distance Apart π |
|
Hard |
|
359 |
Logger Rate Limiter π |
|
Easy |
|
360 |
Sort Transformed Array π |
|
Medium |
|
361 |
Bomb Enemy π |
|
Medium |
|
362 |
Design Hit Counter π |
|
Medium |
|
363 |
Max Sum of Rectangle No Larger Than K |
|
Hard |
|
364 |
Nested List Weight Sum II π |
|
Medium |
|
365 |
Water and Jug Problem |
|
Medium |
|
366 |
Find Leaves of Binary Tree π |
|
Medium |
| β
|
367 |
Valid Perfect Square |
Source |
Easy |
|
368 |
Largest Divisible Subset |
|
Medium |
|
369 |
Plus One Linked List π |
|
Medium |
|
370 |
Range Addition π |
|
Medium |
| β
|
371 |
Sum of Two Integers |
Source |
Easy |
|
372 |
Super Pow |
|
Medium |
|
373 |
Find K Pairs with Smallest Sums |
|
Medium |
| β
|
374 |
Guess Number Higher or Lower |
Source |
Easy |
|
375 |
Guess Number Higher or Lower II |
|
Medium |
|
376 |
Wiggle Subsequence |
|
Medium |
|
377 |
Combination Sum IV |
|
Medium |
|
378 |
Kth Smallest Element in a Sorted Matrix |
|
Medium |
|
379 |
Design Phone Directory π |
|
Medium |
|
380 |
Insert Delete GetRandom O(1) |
|
Medium |
|
381 |
Insert Delete GetRandom O(1) - Duplicates allowed |
|
Hard |
|
382 |
Linked List Random Node |
|
Medium |
|
383 |
Ransom Note |
|
Easy |
|
384 |
Shuffle an Array |
|
Medium |
|
385 |
Mini Parser |
|
Medium |
|
386 |
Lexicographical Numbers |
|
Medium |
|
387 |
First Unique Character in a String |
|
Easy |
|
388 |
Longest Absolute File Path |
|
Medium |
| β
|
389 |
Find the Difference |
Source |
Easy |
|
390 |
Elimination Game |
|
Medium |
|
391 |
Perfect Rectangle |
|
Hard |
|
392 |
Is Subsequence |
|
Medium |
|
393 |
UTF-8 Validation |
|
Medium |
|
394 |
Decode String |
|
Medium |
|
395 |
Longest Substring with At Least K Repeating Characters |
|
Medium |
|
396 |
Rotate Function |
|
Medium |
|
397 |
Integer Replacement |
|
Medium |
|
398 |
Random Pick Index |
|
Medium |
|
399 |
Evaluate Division |
|
Medium |
|
400 |
Nth Digit |
|
Easy |
|
401 |
Binary Watch |
|
Easy |
|
402 |
Remove K Digits |
|
Medium |
|
403 |
Frog Jump |
|
Hard |
|
404 |
Sum of Left Leaves |
|
Easy |
|
405 |
Convert a Number to Hexadecimal |
|
Easy |
|
406 |
Queue Reconstruction by Height |
|
Medium |
|
407 |
Trapping Rain Water II |
|
Hard |
|
408 |
Valid Word Abbreviation π |
|
Easy |
|
409 |
Longest Palindrome |
|
Easy |
|
410 |
Split Array Largest Sum |
|
Hard |
|
411 |
Minimum Unique Word Abbreviation π |
|
Hard |
|
412 |
Fizz Buzz |
|
Easy |
|
413 |
Arithmetic Slices |
|
Medium |
|
414 |
Third Maximum Number |
|
Easy |
|
415 |
Add Strings |
|
Easy |
|
416 |
Partition Equal Subset Sum |
|
Medium |
|
417 |
Pacific Atlantic Water Flow |
|
Medium |
|
418 |
Sentence Screen Fitting π |
|
Medium |
|
419 |
Battleships in a Board |
|
Medium |
|
420 |
Strong Password Checker |
|
Hard |
|
421 |
Maximum XOR of Two Numbers in an Array |
|
Medium |
|
422 |
Valid Word Square π |
|
Easy |
|
423 |
Reconstruct Original Digits from English |
|
Medium |
|
424 |
Longest Repeating Character Replacement |
|
Medium |
|
425 |
Word Squares π |
|
Hard |
|
432 |
All O`one Data Structure |
|
Hard |
|
434 |
Number of Segments in a String |
|
Easy |
|
435 |
Non-overlapping Intervals |
|
Medium |
|
436 |
Find Right Interval |
|
Medium |
|
437 |
Path Sum III |
|
Easy |
|
438 |
Find All Anagrams in a String |
|
Easy |
|
439 |
Ternary Expression Parser π |
|
Medium |
|
440 |
K-th Smallest in Lexicographical Order |
|
Hard |
|
441 |
Arranging Coins |
|
Easy |
|
442 |
Find All Duplicates in an Array |
|
Medium |
|
444 |
Sequence Reconstruction π |
|
Medium |
|
445 |
Add Two Numbers II |
|
Medium |
|
446 |
Arithmetic Slices II - Subsequence |
|
Hard |
|
447 |
Number of Boomerangs |
|
Easy |
|
448 |
Find All Numbers Disappeared in an Array |
|
Easy |
|
449 |
Serialize and Deserialize BST |
|
Medium |
|
450 |
Delete Node in a BST |
|
Medium |
|
451 |
Sort Characters By Frequency |
|
Medium |
|
452 |
Minimum Number of Arrows to Burst Balloons |
|
Medium |
|
453 |
Minimum Moves to Equal Array Elements |
|
Easy |
|
454 |
4Sum II |
|
Medium |
|
455 |
Assign Cookies |
|
Easy |
|
456 |
132 Pattern |
|
Medium |
|
459 |
Repeated Substring Pattern |
|
Easy |
|
460 |
LFU Cache |
|
Hard |
|
461 |
Hamming Distance |
|
Easy |
|
462 |
Minimum Moves to Equal Array Elements II |
|
Medium |
|
463 |
Island Perimeter |
|
Easy |
|
464 |
Can I Win |
|
Medium |
|
465 |
Optimal Account Balancing π |
|
Hard |
|
466 |
Count The Repetitions |
|
Hard |
|
467 |
Unique Substrings in Wraparound String |
|
Medium |
|
468 |
Validate IP Address |
|
Medium |
|
469 |
Convex Polygon π |
|
Medium |
|
471 |
Encode String with Shortest Length π |
|
Hard |
|
472 |
Concatenated Words |
|
Hard |
|
473 |
Matchsticks to Square |
|
Medium |
|
474 |
Ones and Zeroes |
|
Medium |
|
475 |
Heaters |
|
Easy |
| β
|
476 |
Number Complement |
Source |
Easy |
|
477 |
Total Hamming Distance |
|
Medium |
|
479 |
Largest Palindrome Product |
|
Easy |
|
480 |
Sliding Window Median |
|
Hard |
|
481 |
Magical String |
|
Medium |
|
482 |
License Key Formatting |
|
Medium |
|
483 |
Smallest Good Base |
|
Hard |
|
484 |
Find Permutation π |
|
Medium |
| β
|
485 |
Max Consecutive Ones |
Source |
Easy |
|
486 |
Predict the Winner |
|
Medium |
|
487 |
Max Consecutive Ones II π |
|
Medium |
|
488 |
Zuma Game |
|
Hard |
|
490 |
The Maze π |
|
Medium |
|
491 |
Increasing Subsequences |
|
Medium |
|
492 |
Construct the Rectangle |
|
Easy |
|
493 |
Reverse Pairs |
|
Hard |
|
494 |
Target Sum |
|
Medium |
|
495 |
Teemo Attacking |
|
Medium |
|
496 |
Next Greater Element I |
|
Easy |
|
498 |
Diagonal Traverse |
|
Medium |
|
499 |
The Maze III π |
|
Hard |
| β
|
500 |
Keyboard Row |
Source |
Easy |
|
501 |
Find Mode in Binary Search Tree |
|
Easy |
|
502 |
IPO |
|
Hard |
|
503 |
Next Greater Element II |
|
Medium |
| β
|
504 |
Base 7 |
Source |
Easy |
|
505 |
The Maze II π |
|
Medium |
|
506 |
Relative Ranks |
|
Easy |
|
507 |
Perfect Number |
|
Easy |
|
508 |
Most Frequent Subtree Sum |
|
Medium |
|
513 |
Find Bottom Left Tree Value |
|
Medium |
|
514 |
Freedom Trail |
|
Hard |
|
515 |
Find Largest Value in Each Tree Row |
|
Medium |
|
516 |
Longest Palindromic Subsequence |
|
Medium |
|
517 |
Super Washing Machines |
|
Hard |
| β
|
520 |
Detect Capital |
Source |
Easy |
|
521 |
Longest Uncommon Subsequence I |
|
Easy |
|
522 |
Longest Uncommon Subsequence II |
|
Medium |
|
523 |
Continuous Subarray Sum |
|
Medium |
|
524 |
Longest Word in Dictionary through Deleting |
|
Medium |
|
525 |
Contiguous Array |
|
Medium |
|
526 |
Beautiful Arrangement |
|
Medium |
|
527 |
Word Abbreviation π |
|
Hard |
|
529 |
Minesweeper |
|
Medium |
|
530 |
Minimum Absolute Difference in BST |
|
Easy |
|
531 |
Lonely Pixel I π |
|
Medium |
|
532 |
K-diff Pairs in an Array |
|
Easy |
|
533 |
Lonely Pixel II π |
|
Medium |
|
535 |
Encode and Decode TinyURL |
|
Medium |
|
536 |
Construct Binary Tree from String π |
|
Medium |
|
537 |
Complex Number Multiplication |
|
Medium |
|
538 |
Convert BST to Greater Tree |
|
Easy |
|
539 |
Minimum Time Difference |
|
Medium |
|
540 |
Single Element in a Sorted Array |
|
Medium |
|
541 |
Reverse String II |
|
Easy |
|
542 |
01 Matrix |
|
Medium |
|
543 |
Diameter of Binary Tree |
|
Easy |
|
544 |
Output Contest Matches π |
|
Medium |
|
545 |
Boundary of Binary Tree π |
|
Medium |
|
546 |
Remove Boxes |
|
Hard |
|
547 |
Friend Circles |
|
Medium |
|
548 |
Split Array with Equal Sum π |
|
Medium |
|
549 |
Binary Tree Longest Consecutive Sequence II π |
|
Medium |
|
551 |
Student Attendance Record I |
|
Easy |
|
552 |
Student Attendance Record II |
|
Hard |
|
553 |
Optimal Division |
|
Medium |
|
554 |
Brick Wall |
|
Medium |
|
555 |
Split Concatenated Strings π |
|
Medium |
|
556 |
Next Greater Element III |
|
Medium |
|
557 |
Reverse Words in a String III |
|
Easy |
|
560 |
Subarray Sum Equals K |
|
Medium |
|
561 |
Array Partition I |
|
Easy |
|
562 |
Longest Line of Consecutive One in Matrix π |
|
Medium |
|
563 |
Binary Tree Tilt |
|
Easy |
|
564 |
Find the Closest Palindrome |
|
Hard |
|
565 |
Array Nesting |
|
Medium |
|
566 |
Reshape the Matrix |
|
Easy |
|
567 |
Permutation in String |
|
Medium |
|
568 |
Maximum Vacation Days π |
|
Hard |
|
572 |
Subtree of Another Tree |
|
Easy |
|
573 |
Squirrel Simulation π |
|
Medium |
|
575 |
Distribute Candies |
|
Easy |
|
576 |
Out of Boundary Paths |
|
Medium |
|
581 |
Shortest Unsorted Continuous Subarray |
|
Easy |
|
582 |
Kill Process π |
|
Medium |
|
583 |
Delete Operation for Two Strings |
|
Medium |
|
587 |
Erect the Fence |
|
Hard |
|
588 |
Design In-Memory File System π |
|
Hard |
|
591 |
Tag Validator |
|
Hard |
|
592 |
Fraction Addition and Subtraction |
|
Medium |
|
593 |
Valid Square |
|
Medium |
|
594 |
Longest Harmonious Subsequence |
|
Easy |
|
598 |
Range Addition II |
|
Easy |
|
599 |
Minimum Index Sum of Two Lists |
|
Easy |
|
600 |
Non-negative Integers without Consecutive Ones |
|
Hard |
|
604 |
Design Compressed String Iterator π |
|
Easy |
|
605 |
Can Place Flowers |
|
Easy |
|
606 |
Construct String from Binary Tree |
|
Easy |
|
609 |
Find Duplicate File in System |
|
Medium |
|
611 |
Valid Triangle Number |
|
Medium |
|
616 |
Add Bold Tag in String π |
|
Medium |
|
617 |
Merge Two Binary Trees |
|
Easy |
|
621 |
Task Scheduler |
|
Medium |
|
623 |
Add One Row to Tree |
|
Medium |
|
624 |
Maximum Distance in Arrays π |
|
Easy |
|
625 |
Minimum Factorization π |
|
Medium |
|
628 |
Maximum Product of Three Numbers |
|
Easy |
|
629 |
K Inverse Pairs Array |
|
Hard |
|
630 |
Course Schedule III |
|
Medium |
|
631 |
Design Excel Sum Formula π |
|
Hard |
|
632 |
Smallest Range |
|
Hard |
|
633 |
Sum of Square Numbers |
|
Easy |
|
634 |
Find the Derangement of An Array π |
|
Medium |
|
635 |
Design Log Storage System |
|
Medium |
|
637 |
Average of Levels in Binary Tree |
|
Easy |
|
638 |
Shopping Offers |
|
Medium |
|
639 |
Decode Ways II |
|
Hard |
|
640 |
Solve the Equation |
|
Medium |