727 |
Minimum Window Subsequence |
|
Hard |
|
726 |
Number of Atoms |
|
Hard |
|
725 |
Split Linked List in Parts |
|
Medium |
|
724 |
Find Pivot Index |
|
Easy |
|
723 |
Candy Crush |
|
Medium |
|
722 |
Remove Comments |
|
Medium |
|
721 |
Accounts Merge |
|
Medium |
|
720 |
Longest Word in Dictionary |
|
Easy |
|
719 |
Find K-th Smallest Pair Distance |
|
Hard |
|
718 |
Maximum Length of Repeated Subarray |
|
Medium |
|
717 |
1-bit and 2-bit Characters |
|
Easy |
|
716 |
Max Stack |
|
Easy |
|
715 |
Range Module |
cpp |
Hard |
✔️ |
714 |
Best Time to Buy and Sell Stock with Transaction Fee |
|
Medium |
|
713 |
Subarray Product Less Than K |
cpp |
Medium |
✔️ |
712 |
Minimum ASCII Delete Sum for Two Strings |
|
Medium |
|
711 |
Number of Distinct Islands II |
|
Hard |
|
699 |
Falling Squares |
|
Hard |
|
698 |
Partition to K Equal Sum Subsets |
cpp |
Medium |
✔️ |
697 |
Degree of an Array |
cpp |
Easy |
✔️ |
696 |
Count Binary Substrings |
|
Easy |
|
695 |
Max Area of Island |
|
Easy |
|
694 |
Number of Distinct Islands |
|
Medium |
|
693 |
Binary Number with Alternating Bits |
|
Easy |
|
692 |
Top K Frequent Words |
|
Medium |
|
691 |
Stickers to Spell Word |
|
Hard |
|
690 |
Employee Importance |
|
Easy |
|
689 |
Maximum Sum of 3 Non-Overlapping Subarrays |
|
Hard |
|
688 |
Knight Probability in Chessboard |
|
Medium |
|
687 |
Longest Univalue Path |
|
Easy |
|
686 |
Repeated String Match |
cpp |
Easy |
✔️ |
685 |
Redundant Connection II |
|
Hard |
|
684 |
Redundant Connection |
|
Medium |
|
683 |
K Empty Slots |
|
Hard |
|
682 |
Baseball Game |
cpp |
Easy |
✔️ |
681 |
Next Closest Time |
|
Medium |
|
680 |
Valid Palindrome II |
cpp |
Easy |
✔️ |
679 |
24 Game |
cpp |
Hard |
✔️ |
678 |
Valid Parenthesis String |
cpp |
Medium |
✔️ |
677 |
Map Sum Pairs |
cpp |
Medium |
✔️ |
676 |
Implement Magic Dictionary |
|
Medium |
|
675 |
Cut Off Trees for Golf Event |
|
Hard |
|
674 |
Longest Continuous Increasing Subsequence |
cpp |
Easy |
✔️ |
673 |
Number of Longest Increasing Subsequence |
|
Medium |
|
672 |
Bulb Switcher II |
cpp |
Medium |
✔️ |
671 |
Second Minimum Node In a Binary Tree |
|
Easy |
|
670 |
Maximum Swap |
cpp |
Medium |
✔️ |
669 |
Trim a Binary Search Tree |
cpp |
Easy |
✔️ |
668 |
Kth Smallest Number in Multiplication Table |
|
Hard |
|
667 |
Beautiful Arrangement II |
cpp |
Medium |
✔️ |
666 |
Path Sum IV |
|
Medium |
|
665 |
Non-decreasing Array |
cpp |
Easy |
✔️ |
664 |
Strange Printer |
|
Hard |
|
663 |
Equal Tree Partition |
|
Medium |
|
662 |
Maximum Width of Binary Tree |
cpp |
Medium |
✔️ |
661 |
Image Smoother |
cpp |
Easy |
✔️ |
660 |
Remove 9 |
cpp |
Hard |
✔️ |
659 |
Split Array into Consecutive Subsequences |
cpp |
Medium |
✔️ |
658 |
Find K Closest Elements |
cpp |
Medium |
✔️ |
657 |
Judge Route Circle |
cpp |
Easy |
✔️ |
656 |
Coin Path |
|
Hard |
|
655 |
Print Binary Tree |
cpp |
Medium |
✔️ |
654 |
Maximum Binary Tree |
cpp |
Medium |
✔️ |
653 |
Two Sum IV - Input is a BST |
cpp |
Easy |
✔️ |
652 |
Find Duplicate Subtrees |
|
Medium |
|
651 |
4 Keys Keyboard |
|
Medium |
|
650 |
2 Keys Keyboard |
cpp |
Medium |
✔️ |
649 |
Dota2 Senate |
|
Medium |
|
648 |
Replace Words |
Go |
Medium |
✔️ |
647 |
Palindromic Substrings |
cpp |
Medium |
✔️ |
646 |
Maximum Length of Pair Chain |
cpp |
Medium |
✔️ |
645 |
Set Mismatch |
cpp |
Easy |
✔️ |
644 |
Maximum Average Subarray II |
|
Hard |
|
643 |
Maximum Average Subarray I |
cpp |
Easy |
✔️ |
642 |
Design Search Autocomplete System |
|
Hard |
|
640 |
Solve the Equation |
cpp |
Medium |
✔️ |
639 |
Decode Ways II |
cpp |
Hard |
✔️ |
638 |
Shopping Offers |
|
Medium |
|
637 |
Average of Levels in Binary Tree |
cpp |
Easy |
✔️ |
636 |
Exclusive Time of Functions |
cpp |
Medium |
✔️ |
635 |
Design Log Storage System |
cpp |
Medium |
✔️ |
634 |
Find the Derangement of An Array |
cpp |
Medium |
✔️ |
633 |
Sum of Square Numbers |
cpp |
Easy |
✔️ |
632 |
Smallest Range |
cpp |
Hard |
✔️ |
631 |
Design Excel Sum Formula |
cpp |
Hard |
✔️ |
630 |
Course Schedule III |
cpp |
Hard |
✔️ |
629 |
K Inverse Pairs Array |
|
Hard |
|
628 |
Maximum Product of Three Numbers |
Go |
Easy |
✔️ |
625 |
Minimum Factorization |
Go |
Medium |
✔️ |
624 |
Maximum Distance in Arrays |
Go |
Easy |
✔️ |
623 |
Add One Row to Tree |
Go |
Medium |
✔️ |
621 |
Task Scheduler |
Go |
Medium |
✔️ |
617 |
Merge Two Binary Trees |
Go |
Easy |
✔️ |
616 |
Add Bold Tag in String |
|
Medium |
|
611 |
Valid Triangle Number |
Go |
Medium |
✔️ |
609 |
Find Duplicate File in System |
Go |
Medium |
✔️ |
606 |
Construct String from Binary Tree |
Go |
Easy |
✔️ |
605 |
Can Place Flowers |
Go |
Easy |
✔️ |
604 |
Design Compressed String Iterator |
|
Easy |
|
600 |
Non-negative Integers without Consecutive Ones |
Go |
Hard |
✔️ |
599 |
Minimum Index Sum of Two Lists |
cpp |
Easy |
✔️ |
598 |
Range Addition II |
cpp |
Easy |
✔️ |
594 |
Longest Harmonious Subsequence |
cpp |
Easy |
✔️ |
593 |
Valid Square |
cpp |
Medium |
✔️ |
592 |
Fraction Addition and Subtraction |
|
Medium |
|
591 |
Tag Validator |
Go |
Hard |
✔️ |
588 |
Design In-Memory File System |
Go |
Hard |
✔️ |
587 |
Erect the Fence |
Go |
Hard |
✔️ |
583 |
Delete Operation for Two Strings |
cpp |
Medium |
✔️ |
582 |
Kill Process |
|
Medium |
|
581 |
Shortest Unsorted Continuous Subarray |
Go |
Easy |
✔️ |
576 |
Out of Boundary Paths |
Go |
Medium |
✔️ |
575 |
Distribute Candies |
cpp |
Easy |
✔️ |
573 |
Squirrel Simulation |
|
Medium |
|
572 |
Subtree of Another Tree |
cpp |
Easy |
✔️ |
568 |
Maximum Vacation Days |
|
Hard |
|
567 |
Permutation in String |
Go |
Medium |
✔️ |
566 |
Reshape the Matrix |
cpp |
Easy |
✔️ |
564 |
Find the Closest Palindrome |
Go |
Hard |
✔️ |
563 |
Binary Tree Tilt |
cpp |
Easy |
✔️ |
562 |
Longest Line of Consecutive One in Matrix |
|
Medium |
|
561 |
Array Partition I |
cpp |
Easy |
✔️ |
560 |
Subarray Sum Equals K |
cpp |
Medium |
✔️ |
557 |
Reverse Words in a String III |
Go |
Easy |
✔️ |
556 |
Next Greater Element III |
cpp |
Medium |
✔️ |
555 |
Split Concatenated Strings |
|
Medium |
|
554 |
Brick Wall |
cpp |
Medium |
✔️ |
553 |
Optimal Division |
|
Medium |
|
552 |
Student Attendance Record II |
Go |
Hard |
✔️ |
551 |
Student Attendance Record I |
Go |
Easy |
✔️ |
549 |
Binary Tree Longest Consecutive Sequence II |
|
Medium |
|
548 |
Split Array with Equal Sum |
|
Medium |
|
547 |
Friend Circles |
Go |
Medium |
✔️ |
546 |
Remove Boxes |
Go |
Hard |
✔️ |
545 |
Boundary of Binary Tree |
|
Medium |
|
544 |
Output Contest Matches |
|
Medium |
|
543 |
Diameter of Binary Tree |
cpp |
Easy |
✔️ |
542 |
01 Matrix |
Go |
Medium |
✔️ |
541 |
Reverse String II |
cpp |
Easy |
✔️ |
540 |
Single Element in a Sorted Array |
cpp |
Medium |
✔️ |
539 |
Minimum Time Difference |
Go |
Medium |
✔️ |
538 |
Convert BST to Greater Tree |
Go |
Easy |
✔️ |
537 |
Complex Number Multiplication |
cpp |
Medium |
✔️ |
536 |
Construct Binary Tree from String |
|
Medium |
|
535 |
Encode and Decode TinyURL |
cpp |
Medium |
✔️ |
533 |
Lonely Pixel II |
|
Medium |
|
532 |
K-diff Pairs in an Array |
cpp |
Easy |
✔️ |
531 |
Lonely Pixel I |
|
Medium |
|
530 |
Minimum Absolute Difference in BST |
cpp |
Easy |
✔️ |
529 |
Minesweeper |
|
Medium |
|
527 |
Word Abbreviation |
|
Hard |
|
526 |
Beautiful Arrangement |
cpp |
Medium |
✔️ |
525 |
Contiguous Array |
cpp |
Medium |
✔️ |
524 |
Longest Word in Dictionary through Deleting |
cpp |
Medium |
✔️ |
523 |
Continuous Subarray Sum |
Go |
Medium |
✔️ |
522 |
Longest Uncommon Subsequence II |
cpp |
Medium |
✔️ |
521 |
Longest Uncommon Subsequence I |
cpp |
Easy |
✔️ |
520 |
Detect Capital |
cpp |
Easy |
✔️ |
517 |
Super Washing Machines |
Go |
Hard |
✔️ |
516 |
Longest Palindromic Subsequence |
Go |
Medium |
✔️ |
515 |
Find Largest Value in Each Tree Row |
cpp |
Medium |
✔️ |
514 |
Freedom Trail |
Go |
Hard |
✔️ |
513 |
Find Bottom Left Tree Value |
cpp |
Medium |
✔️ |
508 |
Most Frequent Subtree Sum |
cpp |
Medium |
✔️ |
507 |
Perfect Number |
Go |
Easy |
✔️ |
506 |
Relative Ranks |
cpp |
Easy |
✔️ |
505 |
The Maze II |
|
Medium |
|
504 |
Base 7 |
cpp |
Easy |
✔️ |
503 |
Next Greater Element II |
cpp |
Medium |
✔️ |
502 |
IPO |
Go |
Hard |
✔️ |
501 |
Find Mode in Binary Search Tree |
cpp |
Easy |
✔️ |
500 |
Keyboard Row |
cpp |
Easy |
✔️ |
499 |
The Maze III |
|
Hard |
|
498 |
Diagonal Traverse |
cpp |
Medium |
✔️ |
496 |
Next Greater Element I |
cpp |
Easy |
✔️ |
495 |
Teemo Attacking |
cpp |
Medium |
✔️ |
494 |
Target Sum |
Go |
Medium |
✔️ |
493 |
Reverse Pairs |
Go |
Hard |
✔️ |
492 |
Construct the Rectangle |
cpp |
Easy |
✔️ |
491 |
Increasing Subsequences |
|
Medium |
|
490 |
The Maze |
|
Medium |
|
488 |
Zuma Game |
Go |
Hard |
✔️ |
487 |
Max Consecutive Ones II |
|
Medium |
|
486 |
Predict the Winner |
Go |
Medium |
✔️ |
485 |
Max Consecutive Ones |
cpp |
Easy |
✔️ |
484 |
Find Permutation |
|
Medium |
|
483 |
Smallest Good Base |
Go |
Hard |
✔️ |
482 |
License Key Formatting |
cpp |
Medium |
✔️ |
481 |
Magical String |
cpp |
Medium |
✔️ |
480 |
Sliding Window Median |
Go |
Hard |
✔️ |
479 |
Largest Palindrome Product |
|
Easy |
|
477 |
Total Hamming Distance |
cpp |
Medium |
✔️ |
476 |
Number Complement |
Go |
Easy |
✔️ |
475 |
Heaters |
cpp |
Easy |
✔️ |
474 |
Ones and Zeroes |
Go |
Medium |
✔️ |
473 |
Matchsticks to Square |
|
Medium |
|
472 |
Concatenated Words |
Go |
Hard |
✔️ |
471 |
Encode String with Shortest Length |
|
Hard |
|
469 |
Convex Polygon |
|
Medium |
|
468 |
Validate IP Address |
Go |
Medium |
✔️ |
467 |
Unique Substrings in Wraparound String |
Go |
Medium |
✔️ |
466 |
Count The Repetitions |
Go |
Hard |
✔️ |
465 |
Optimal Account Balancing |
|
Hard |
|
464 |
Can I Win |
Go |
Medium |
✔️ |
463 |
Island Perimeter |
cpp |
Easy |
✔️ |
462 |
Minimum Moves to Equal Array Elements II |
cpp |
Medium |
✔️ |
461 |
Hamming Distance |
Go |
Easy |
✔️ |
460 |
LFU Cache |
Go |
Hard |
✔️ |
459 |
Repeated Substring Pattern |
cpp |
Easy |
✔️ |
456 |
132 Pattern |
cpp |
Medium |
✔️ |
455 |
Assign Cookies |
cpp |
Easy |
✔️ |
454 |
4Sum II |
cpp |
Medium |
✔️ |
453 |
Minimum Moves to Equal Array Elements |
cpp |
Easy |
✔️ |
452 |
Minimum Number of Arrows to Burst Balloons |
cpp |
Medium |
✔️ |
451 |
Sort Characters By Frequency |
cpp |
Medium |
✔️ |
450 |
Delete Node in a BST |
cpp |
Medium |
✔️ |
449 |
Serialize and Deserialize BST |
Python |
Medium |
✔️ |
448 |
Find All Numbers Disappeared in an Array |
cpp |
Easy |
✔️ |
447 |
Number of Boomerangs |
cpp |
Easy |
✔️ |
446 |
Arithmetic Slices II - Subsequence |
Go |
Hard |
✔️ |
445 |
Add Two Numbers II |
cpp |
Medium |
✔️ |
444 |
Sequence Reconstruction |
|
Medium |
|
443 |
String Compression |
|
Easy |
|
442 |
Find All Duplicates in an Array |
cpp |
Medium |
✔️ |
441 |
Arranging Coins |
Go |
Easy |
✔️ |
440 |
K-th Smallest in Lexicographical Order |
Go |
Hard |
✔️ |
439 |
Ternary Expression Parser |
|
Medium |
|
438 |
Find All Anagrams in a String |
Go |
Easy |
✔️ |
437 |
Path Sum III |
cpp |
Easy |
✔️ |
436 |
Find Right Interval |
cpp |
Medium |
✔️ |
435 |
Non-overlapping Intervals |
cpp |
Medium |
✔️ |
434 |
Number of Segments in a String |
Go |
Easy |
✔️ |
432 |
All O`one Data Structure |
Go |
Hard |
✔️ |
425 |
Word Squares |
|
Hard |
|
424 |
Longest Repeating Character Replacement |
cpp |
Medium |
✔️ |
423 |
Reconstruct Original Digits from English |
|
Medium |
|
422 |
Valid Word Square |
|
Easy |
|
421 |
Maximum XOR of Two Numbers in an Array |
|
Medium |
|
420 |
Strong Password Checker |
Go |
Hard |
✔️ |
419 |
Battleships in a Board |
Java |
Medium |
✔️ |
418 |
Sentence Screen Fitting |
|
Medium |
|
417 |
Pacific Atlantic Water Flow |
cpp |
Medium |
✔️ |
416 |
Partition Equal Subset Sum |
Go |
Medium |
✔️ |
415 |
Add Strings |
cpp |
Easy |
✔️ |
414 |
Third Maximum Number |
Go |
Easy |
✔️ |
413 |
Arithmetic Slices |
Go |
Medium |
✔️ |
412 |
Fizz Buzz |
cpp |
Easy |
✔️ |
411 |
Minimum Unique Word Abbreviation |
|
Hard |
|
410 |
Split Array Largest Sum |
Go |
Hard |
✔️ |
409 |
Longest Palindrome |
cpp |
Easy |
✔️ |
408 |
Valid Word Abbreviation |
|
Easy |
|
407 |
Trapping Rain Water II |
Go |
Hard |
✔️ |
406 |
Queue Reconstruction by Height |
cpp |
Medium |
✔️ |
405 |
Convert a Number to Hexadecimal |
cpp |
Easy |
✔️ |
404 |
Sum of Left Leaves |
cpp |
Easy |
✔️ |
403 |
Frog Jump |
Go |
Hard |
✔️ |
402 |
Remove K Digits |
Go |
Medium |
✔️ |
401 |
Binary Watch |
|
Easy |
|
400 |
Nth Digit |
Go |
Easy |
✔️ |
399 |
Evaluate Division |
cpp |
Medium |
✔️ |
398 |
Random Pick Index |
cpp |
Medium |
✔️ |
397 |
Integer Replacement |
cpp |
Medium |
✔️ |
396 |
Rotate Function |
Go |
Medium |
✔️ |
395 |
Longest Substring with At Least K Repeating Characters |
cpp |
Medium |
✔️ |
394 |
Decode String |
cpp |
Medium |
✔️ |
393 |
UTF-8 Validation |
Go |
Medium |
✔️ |
392 |
Is Subsequence |
Go |
Medium |
✔️ |
391 |
Perfect Rectangle |
Go |
Hard |
✔️ |
390 |
Elimination Game |
cpp |
Medium |
✔️ |
389 |
Find the Difference |
cpp |
Easy |
✔️ |
388 |
Longest Absolute File Path |
|
Medium |
|
387 |
First Unique Character in a String |
cpp |
Easy |
✔️ |
386 |
Lexicographical Numbers |
cpp |
Medium |
✔️ |
385 |
Mini Parser |
cpp |
Medium |
✔️ |
384 |
Shuffle an Array |
cpp |
Medium |
✔️ |
383 |
Ransom Note |
|
Easy |
404 |
382 |
Linked List Random Node |
cpp |
Medium |
✔️ |
381 |
Insert Delete GetRandom O(1) - Duplicates allowed |
Go |
Hard |
✔️ |
380 |
Insert Delete GetRandom O(1) |
Go |
Medium |
✔️ |
379 |
Design Phone Directory |
|
Medium |
|
378 |
Kth Smallest Element in a Sorted Matrix |
cpp |
Medium |
✔️ |
377 |
Combination Sum IV |
Go |
Medium |
✔️ |
376 |
Wiggle Subsequence |
Go |
Medium |
✔️ |
375 |
Guess Number Higher or Lower II |
Go |
Medium |
✔️ |
374 |
Guess Number Higher or Lower |
cpp |
Easy |
✔️ |
373 |
Find K Pairs with Smallest Sums |
cpp |
Medium |
✔️ |
372 |
Super Pow |
cpp |
Medium |
✔️ |
371 |
Sum of Two Integers |
cpp |
Easy |
✔️ |
370 |
Range Addition |
|
Medium |
|
369 |
Plus One Linked List |
|
Medium |
|
368 |
Largest Divisible Subset |
Go |
Medium |
✔️ |
367 |
Valid Perfect Square |
cpp |
Easy |
✔️ |
366 |
Find Leaves of Binary Tree |
|
Medium |
|
365 |
Water and Jug Problem |
Go |
Medium |
✔️ |
364 |
Nested List Weight Sum II |
|
Medium |
|
363 |
Max Sum of Rectangle No Larger Than K |
Go |
Hard |
✔️ |
362 |
Design Hit Counter |
|
Medium |
|
361 |
Bomb Enemy |
|
Medium |
|
360 |
Sort Transformed Array |
|
Medium |
|
359 |
Logger Rate Limiter |
|
Easy |
|
358 |
Rearrange String k Distance Apart |
|
Hard |
|
357 |
Count Numbers with Unique Digits |
Go |
Medium |
✔️ |
356 |
Line Reflection |
|
Medium |
|
355 |
Design Twitter |
Go |
Medium |
✔️ |
354 |
Russian Doll Envelopes |
Go |
Hard |
✔️ |
353 |
Design Snake Game |
|
Medium |
|
352 |
Data Stream as Disjoint Intervals |
Go |
Hard |
✔️ |
351 |
Android Unlock Patterns |
|
Medium |
|
350 |
Intersection of Two Arrays II |
cpp |
Easy |
✔️ |
349 |
Intersection of Two Arrays |
cpp |
Easy |
✔️ |
348 |
Design Tic-Tac-Toe |
|
Medium |
|
347 |
Top K Frequent Elements |
Go |
Medium |
✔️ |
346 |
Moving Average from Data Stream |
|
Easy |
|
345 |
Reverse Vowels of a String |
cpp |
Easy |
✔️ |
344 |
Reverse String |
cpp |
Easy |
✔️ |
343 |
Integer Break |
Go |
Medium |
✔️ |
342 |
Power of Four |
cpp |
Easy |
✔️ |
341 |
Flatten Nested List Iterator |
cpp |
Medium |
✔️ |
340 |
Longest Substring with At Most K Distinct Characters |
|
Hard |
|
339 |
Nested List Weight Sum |
|
Easy |
|
338 |
Counting Bits |
Go |
Medium |
✔️ |
337 |
House Robber III |
Go |
Medium |
✔️ |
336 |
Palindrome Pairs |
Go |
Hard |
✔️ |
335 |
Self Crossing |
Go |
Hard |
✔️ |
334 |
Increasing Triplet Subsequence |
cpp |
Medium |
✔️ |
333 |
Largest BST Subtree |
|
Medium |
|
332 |
Reconstruct Itinerary |
cpp |
Medium |
✔️ |
331 |
Verify Preorder Serialization of a Binary Tree |
cpp |
Medium |
✔️ |
330 |
Patching Array |
Go |
Hard |
✔️ |
329 |
Longest Increasing Path in a Matrix |
Go |
Hard |
✔️ |
328 |
Odd Even Linked List |
cpp |
Medium |
✔️ |
327 |
Count of Range Sum |
Go |
Hard |
✔️ |
326 |
Power of Three |
Go |
Easy |
✔️ |
325 |
Maximum Size Subarray Sum Equals k |
|
Medium |
|
324 |
Wiggle Sort II |
Go |
Medium |
✔️ |
323 |
Number of Connected Components in an Undirected Graph |
|
Medium |
|
322 |
Coin Change |
Go |
Medium |
✔️ |
321 |
Create Maximum Number |
Go |
Hard |
✔️ |
320 |
Generalized Abbreviation |
|
Medium |
|
319 |
Bulb Switcher |
cpp |
Medium |
✔️ |
318 |
Maximum Product of Word Lengths |
cpp |
Medium |
✔️ |
317 |
Shortest Distance from All Buildings |
|
Hard |
|
316 |
Remove Duplicate Letters |
Go |
Hard |
✔️ |
315 |
Count of Smaller Numbers After Self |
Go |
Hard |
✔️ |
314 |
Binary Tree Vertical Order Traversal |
|
Medium |
|
313 |
Super Ugly Number |
cpp |
Medium |
✔️ |
312 |
Burst Balloons |
Go |
Hard |
✔️ |
311 |
Sparse Matrix Multiplication |
|
Medium |
|
310 |
Minimum Height Trees |
cpp |
Medium |
✔️ |
309 |
Best Time to Buy and Sell Stock with Cooldown |
Go |
Medium |
✔️ |
308 |
Range Sum Query 2D - Mutable |
|
Hard |
|
307 |
Range Sum Query - Mutable |
Go |
Medium |
✔️ |
306 |
Additive Number |
|
Medium |
|
305 |
Number of Islands II |
|
Hard |
|
304 |
Range Sum Query 2D - Immutable |
Go |
Medium |
✔️ |
303 |
Range Sum Query - Immutable |
Go |
Easy |
✔️ |
302 |
Smallest Rectangle Enclosing Black Pixels |
|
Hard |
|
301 |
Remove Invalid Parentheses |
Go |
Hard |
✔️ |
300 |
Longest Increasing Subsequence |
Go |
Medium |
✔️ |
299 |
Bulls and Cows |
|
Medium |
|
298 |
Binary Tree Longest Consecutive Sequence |
|
Medium |
|
297 |
Serialize and Deserialize Binary Tree |
Python |
Hard |
✔️ |
296 |
Best Meeting Point |
|
Hard |
|
295 |
Find Median from Data Stream |
Go |
Hard |
✔️ |
294 |
Flip Game II |
|
Medium |
|
293 |
Flip Game |
|
Easy |
|
292 |
Nim Game |
|
Easy |
|
291 |
Word Pattern II |
|
Hard |
|
290 |
Word Pattern |
Go |
Easy |
✔️ |
289 |
Game of Life |
Go |
Medium |
✔️ |
288 |
Unique Word Abbreviation |
|
Medium |
|
287 |
Find the Duplicate Number |
cpp |
Medium |
✔️ |
286 |
Walls and Gates |
|
Medium |
|
285 |
Inorder Successor in BST |
|
Medium |
|
284 |
Peeking Iterator |
cpp |
Medium |
✔️ |
283 |
Move Zeroes |
cpp |
Easy |
✔️ |
282 |
Expression Add Operators |
Go |
Hard |
✔️ |
281 |
Zigzag Iterator |
|
Medium |
|
280 |
Wiggle Sort |
|
Medium |
|
279 |
Perfect Squares |
Go |
Medium |
✔️ |
278 |
First Bad Version |
Python |
Easy |
✔️ |
277 |
Find the Celebrity |
|
Medium |
|
276 |
Paint Fence |
|
Easy |
|
275 |
H-Index II |
Go |
Medium |
✔️ |
274 |
H-Index |
Go |
Medium |
✔️ |
273 |
Integer to English Words |
Go |
Hard |
✔️ |
272 |
Closest Binary Search Tree Value II |
|
Hard |
|
271 |
Encode and Decode Strings |
|
Medium |
|
270 |
Closest Binary Search Tree Value |
|
Easy |
|
269 |
Alien Dictionary |
|
Hard |
|
268 |
Missing Number |
Go |
Easy |
✔️ |
267 |
Palindrome Permutation II |
|
Medium |
|
266 |
Palindrome Permutation |
|
Easy |
|
265 |
Paint House II |
|
Hard |
|
264 |
Ugly Number II |
Go |
Medium |
✔️ |
263 |
Ugly Number |
Go |
Easy |
✔️ |
261 |
Graph Valid Tree |
|
Medium |
|
260 |
Single Number III |
cpp |
Medium |
✔️ |
259 |
3Sum Smaller |
|
Medium |
|
258 |
Add Digits |
cpp |
Easy |
✔️ |
257 |
Binary Tree Paths |
cpp |
Easy |
✔️ |
256 |
Paint House |
|
Easy |
|
255 |
Verify Preorder Sequence in Binary Search Tree |
|
Medium |
|
254 |
Factor Combinations |
|
Medium |
|
253 |
Meeting Rooms II |
|
Medium |
|
252 |
Meeting Rooms |
|
Easy |
|
251 |
Flatten 2D Vector |
|
Medium |
|
250 |
Count Univalue Subtrees |
|
Medium |
|
249 |
Group Shifted Strings |
|
Medium |
|
248 |
Strobogrammatic Number III |
|
Hard |
|
247 |
Strobogrammatic Number II |
|
Medium |
|
246 |
Strobogrammatic Number |
|
Easy |
|
245 |
Shortest Word Distance III |
|
Medium |
|
244 |
Shortest Word Distance II |
|
Medium |
|
243 |
Shortest Word Distance |
|
Easy |
|
242 |
Valid Anagram |
cpp |
Easy |
✔️ |
241 |
Different Ways to Add Parentheses |
cpp |
Medium |
✔️ |
240 |
Search a 2D Matrix II |
cpp |
Medium |
✔️ |
239 |
Sliding Window Maximum |
Go |
Hard |
✔️ |
238 |
Product of Array Except Self |
cpp |
Medium |
✔️ |
237 |
Delete Node in a Linked List |
cpp |
Easy |
✔️ |
236 |
Lowest Common Ancestor of a Binary Tree |
cpp |
Medium |
✔️ |
235 |
Lowest Common Ancestor of a Binary Search Tree |
cpp |
Easy |
✔️ |
234 |
Palindrome Linked List |
cpp |
Easy |
✔️ |
233 |
Number of Digit One |
Go |
Hard |
✔️ |
232 |
Implement Queue using Stacks |
cpp |
Easy |
✔️ |
231 |
Power of Two |
Go |
Easy |
✔️ |
230 |
Kth Smallest Element in a BST |
cpp |
Medium |
✔️ |
229 |
Majority Element II |
|
Medium |
|
228 |
Summary Ranges |
Go |
Medium |
✔️ |
227 |
Basic Calculator II |
Go |
Medium |
✔️ |
226 |
Invert Binary Tree |
cpp |
Easy |
✔️ |
225 |
Implement Stack using Queues |
Go |
Easy |
✔️ |
224 |
Basic Calculator |
Go |
Hard |
✔️ |
223 |
Rectangle Area |
Go |
Medium |
✔️ |
222 |
Count Complete Tree Nodes |
cpp |
Medium |
✔️ |
221 |
Maximal Square |
Go |
Medium |
✔️ |
220 |
Contains Duplicate III |
Go |
Medium |
✔️ |
219 |
Contains Duplicate II |
Go |
Easy |
✔️ |
218 |
The Skyline Problem |
Go |
Hard |
✔️ |
217 |
Contains Duplicate |
Go |
Easy |
✔️ |
216 |
Combination Sum III |
cpp |
Medium |
✔️ |
215 |
Kth Largest Element in an Array |
Go |
Medium |
✔️ |
214 |
Shortest Palindrome |
Go |
Hard |
✔️ |
213 |
House Robber II |
Go |
Medium |
✔️ |
212 |
Word Search II |
Go |
Hard |
✔️ |
211 |
Add and Search Word - Data structure design |
Go |
Medium |
✔️ |
210 |
Course Schedule II |
Go |
Medium |
✔️ |
209 |
Minimum Size Subarray Sum |
Go |
Medium |
✔️ |
208 |
Implement Trie (Prefix Tree) |
Go |
Medium |
✔️ |
207 |
Course Schedule |
Go |
Medium |
✔️ |
206 |
Reverse Linked List |
Go |
Easy |
✔️ |
205 |
Isomorphic Strings |
Go |
Easy |
✔️ |
204 |
Count Primes |
Go |
Easy |
✔️ |
203 |
Remove Linked List Elements |
Go |
Easy |
✔️ |
202 |
Happy Number |
Go |
Easy |
✔️ |
201 |
Bitwise AND of Numbers Range |
Go |
Medium |
✔️ |
200 |
Number of Islands |
Go |
Medium |
✔️ |
199 |
Binary Tree Right Side View |
Go |
Medium |
✔️ |
198 |
House Robber |
Go |
Easy |
✔️ |
191 |
Number of 1 Bits |
Python |
Easy |
✔️ |
190 |
Reverse Bits |
Python |
Easy |
✔️ |
189 |
Rotate Array |
Go |
Easy |
✔️ |
188 |
Best Time to Buy and Sell Stock IV |
Go |
Hard |
✔️ |
187 |
Repeated DNA Sequences |
Go |
Medium |
✔️ |
186 |
Reverse Words in a String II |
|
Medium |
|
179 |
Largest Number |
Go |
Medium |
✔️ |
174 |
Dungeon Game |
Go |
Hard |
✔️ |
173 |
Binary Search Tree Iterator |
cpp |
Medium |
✔️ |
172 |
Factorial Trailing Zeroes |
Go |
Easy |
✔️ |
171 |
Excel Sheet Column Number |
Go |
Easy |
✔️ |
170 |
Two Sum III - Data structure design |
|
Easy |
|
169 |
Majority Element |
Go |
Easy |
✔️ |
168 |
Excel Sheet Column Title |
Go |
Easy |
✔️ |
167 |
Two Sum II - Input array is sorted |
Go |
Easy |
✔️ |
166 |
Fraction to Recurring Decimal |
Go |
Medium |
✔️ |
165 |
Compare Version Numbers |
Go |
Medium |
✔️ |
164 |
Maximum Gap |
Go |
Hard |
✔️ |
163 |
Missing Ranges |
|
Medium |
|
162 |
Find Peak Element |
Go |
Medium |
✔️ |
161 |
One Edit Distance |
|
Medium |
|
160 |
Intersection of Two Linked Lists |
Python |
Easy |
✔️ |
159 |
Longest Substring with At Most Two Distinct Characters |
|
Hard |
|
158 |
Read N Characters Given Read4 II - Call multiple times |
|
Hard |
|
157 |
Read N Characters Given Read4 |
|
Easy |
|
156 |
Binary Tree Upside Down |
|
Medium |
|
155 |
Min Stack |
Go |
Easy |
✔️ |
154 |
Find Minimum in Rotated Sorted Array II |
Go |
Hard |
✔️ |
153 |
Find Minimum in Rotated Sorted Array |
Go |
Medium |
✔️ |
152 |
Maximum Product Subarray |
Go |
Medium |
✔️ |
151 |
Reverse Words in a String |
Python |
Medium |
✔️ |
150 |
Evaluate Reverse Polish Notation |
Go |
Medium |
✔️ |
149 |
Max Points on a Line |
Go |
Hard |
✔️ |
148 |
Sort List |
Go |
Medium |
✔️ |
147 |
Insertion Sort List |
Go |
Medium |
✔️ |
146 |
LRU Cache |
Go |
Hard |
✔️ |
145 |
Binary Tree Postorder Traversal |
Go |
Hard |
✔️ |
144 |
Binary Tree Preorder Traversal |
Go |
Medium |
✔️ |
143 |
Reorder List |
Go |
Medium |
✔️ |
142 |
Linked List Cycle II |
cpp |
Medium |
✔️ |
141 |
Linked List Cycle |
Python |
Easy |
✔️ |
140 |
Word Break II |
Go |
Hard |
✔️ |
139 |
Word Break |
Go |
Medium |
✔️ |
138 |
Copy List with Random Pointer |
Python |
Medium |
✔️ |
137 |
Single Number II |
Go |
Medium |
✔️ |
136 |
Single Number |
Go |
Easy |
✔️ |
135 |
Candy |
Go |
Hard |
✔️ |
134 |
Gas Station |
Go |
Medium |
✔️ |
133 |
Clone Graph |
cpp |
Medium |
✔️ |
132 |
Palindrome Partitioning II |
Go |
Hard |
✔️ |
131 |
Palindrome Partitioning |
|
Medium |
|
130 |
Surrounded Regions |
Go |
Medium |
✔️ |
129 |
Sum Root to Leaf Numbers |
Go |
Medium |
✔️ |
128 |
Longest Consecutive Sequence |
Go |
Hard |
✔️ |
127 |
Word Ladder |
Go |
Medium |
✔️ |
126 |
Word Ladder II |
Go |
Hard |
✔️ |
125 |
Valid Palindrome |
Go |
Easy |
✔️ |
124 |
Binary Tree Maximum Path Sum |
Go |
Hard |
✔️ |
123 |
Best Time to Buy and Sell Stock III |
Go |
Hard |
✔️ |
122 |
Best Time to Buy and Sell Stock II |
Go |
Easy |
✔️ |
121 |
Best Time to Buy and Sell Stock |
Go |
Easy |
✔️ |
120 |
Triangle |
Go |
Medium |
✔️ |
119 |
Pascal's Triangle II |
Go |
Easy |
✔️ |
118 |
Pascal's Triangle |
Go |
Easy |
✔️ |
117 |
Populating Next Right Pointers in Each Node II |
Python |
Medium |
✔️ |
116 |
Populating Next Right Pointers in Each Node |
Python |
Medium |
✔️ |
115 |
Distinct Subsequences |
Go |
Hard |
✔️ |
114 |
Flatten Binary Tree to Linked List |
Go |
Medium |
✔️ |
113 |
Path Sum II |
Go |
Medium |
✔️ |
112 |
Path Sum |
Go |
Easy |
✔️ |
111 |
Minimum Depth of Binary Tree |
Go |
Easy |
✔️ |
110 |
Balanced Binary Tree |
Go |
Easy |
✔️ |
109 |
Convert Sorted List to Binary Search Tree |
Go |
Medium |
✔️ |
108 |
Convert Sorted Array to Binary Search Tree |
Go |
Easy |
✔️ |
107 |
Binary Tree Level Order Traversal II |
Go |
Easy |
✔️ |
106 |
Construct Binary Tree from Inorder and Postorder Traversal |
Go |
Medium |
✔️ |
105 |
Construct Binary Tree from Preorder and Inorder Traversal |
Go |
Medium |
✔️ |
104 |
Maximum Depth of Binary Tree |
Go |
Easy |
✔️ |
103 |
Binary Tree Zigzag Level Order Traversal |
Go |
Medium |
✔️ |
102 |
Binary Tree Level Order Traversal |
Go |
Medium |
✔️ |
101 |
Symmetric Tree |
Go |
Easy |
✔️ |
100 |
Same Tree |
Go |
Easy |
✔️ |
99 |
Recover Binary Search Tree |
Go |
Hard |
✔️ |
98 |
Validate Binary Search Tree |
Go |
Medium |
✔️ |
97 |
Interleaving String |
Go |
Hard |
✔️ |
96 |
Unique Binary Search Trees |
Go |
Medium |
✔️ |
95 |
Unique Binary Search Trees II |
Go |
Medium |
✔️ |
94 |
Binary Tree Inorder Traversal |
Go |
Medium |
✔️ |
93 |
Restore IP Addresses |
Go |
Medium |
✔️ |
92 |
Reverse Linked List II |
Go |
Medium |
✔️ |
91 |
Decode Ways |
Go |
Medium |
✔️ |
90 |
Subsets II |
Go |
Medium |
✔️ |
89 |
Gray Code |
Go |
Medium |
✔️ |
88 |
Merge Sorted Array |
Go |
Easy |
✔️ |
87 |
Scramble String |
Go |
Hard |
✔️ |
86 |
Partition List |
Go |
Medium |
✔️ |
85 |
Maximal Rectangle |
Go |
Hard |
✔️ |
84 |
Largest Rectangle in Histogram |
Go |
Hard |
✔️ |
83 |
Remove Duplicates from Sorted List |
Go |
Easy |
✔️ |
82 |
Remove Duplicates from Sorted List II |
Go |
Medium |
✔️ |
81 |
Search in Rotated Sorted Array II |
Go |
Medium |
✔️ |
80 |
Remove Duplicates from Sorted Array II |
Go |
Medium |
✔️ |
79 |
Word Search |
Go |
Medium |
✔️ |
78 |
Subsets |
Go |
Medium |
✔️ |
77 |
Combinations |
Go |
Medium |
✔️ |
76 |
Minimum Window Substring |
Go |
Hard |
✔️ |
75 |
Sort Colors |
Go |
Medium |
✔️ |
74 |
Search a 2D Matrix |
Go |
Medium |
✔️ |
73 |
Set Matrix Zeroes |
Go |
Medium |
✔️ |
72 |
Edit Distance |
Go |
Hard |
✔️ |
71 |
Simplify Path |
Go |
Medium |
✔️ |
70 |
Climbing Stairs |
Go |
Easy |
✔️ |
69 |
Sqrt(x) |
Go |
Easy |
✔️ |
68 |
Text Justification |
Go |
Hard |
✔️ |
67 |
Add Binary |
Go |
Easy |
✔️ |
66 |
Plus One |
Go |
Easy |
✔️ |
65 |
Valid Number |
Go |
Hard |
✔️ |
64 |
Minimum Path Sum |
Go |
Medium |
✔️ |
63 |
Unique Paths II |
Go |
Medium |
✔️ |
62 |
Unique Paths |
Go |
Medium |
✔️ |
61 |
Rotate List |
Go |
Medium |
✔️ |
60 |
Permutation Sequence |
Go |
Medium |
✔️ |
59 |
Spiral Matrix II |
Go |
Medium |
✔️ |
58 |
Length of Last Word |
Go |
Easy |
✔️ |
57 |
Insert Interval |
Go |
Hard |
✔️ |
56 |
Merge Intervals |
Go |
Medium |
✔️ |
55 |
Jump Game |
Go |
Medium |
✔️ |
54 |
Spiral Matrix |
Go |
Medium |
✔️ |
53 |
Maximum Subarray |
Go |
Easy |
✔️ |
52 |
N-Queens II |
Go |
Hard |
✔️ |
51 |
N-Queens |
Go |
Hard |
✔️ |
50 |
Pow(x, n) |
Go |
Medium |
✔️ |
49 |
Group Anagrams |
Go |
Medium |
✔️ |
48 |
Rotate Image |
Go |
Medium |
✔️ |
47 |
Permutations II |
Go |
Medium |
✔️ |
46 |
Permutations |
Go |
Medium |
✔️ |
45 |
Jump Game II |
Go |
Hard |
✔️ |
44 |
Wildcard Matching |
Go |
Hard |
✔️ |
43 |
Multiply Strings |
Go |
Medium |
✔️ |
42 |
Trapping Rain Water |
Go |
Hard |
✔️ |
41 |
First Missing Positive |
Go |
Hard |
✔️ |
40 |
Combination Sum II |
Go |
Medium |
✔️ |
39 |
Combination Sum |
Go |
Medium |
✔️ |
38 |
Count and Say |
Go |
Easy |
✔️ |
37 |
Sudoku Solver |
Go |
Hard |
✔️ |
36 |
Valid Sudoku |
Go |
Medium |
✔️ |
35 |
Search Insert Position |
Go |
Easy |
✔️ |
34 |
Search for a Range |
Go |
Medium |
✔️ |
33 |
Search in Rotated Sorted Array |
Go |
Medium |
✔️ |
32 |
Longest Valid Parentheses |
Go |
Hard |
✔️ |
31 |
Next Permutation |
Go |
Medium |
✔️ |
30 |
Substring with Concatenation of All Words |
Go |
Hard |
✔️ |
29 |
Divide Two Integers |
Go |
Medium |
✔️ |
28 |
Implement strStr() |
Go |
Easy |
✔️ |
27 |
Remove Element |
Go |
Easy |
✔️ |
26 |
Remove Duplicates from Sorted Array |
Go |
Easy |
✔️ |
25 |
Reverse Nodes in k-Group |
Go |
Hard |
✔️ |
24 |
Swap Nodes in Pairs |
Go |
Medium |
✔️ |
23 |
Merge k Sorted Lists |
Go |
Hard |
✔️ |
22 |
Generate Parentheses |
Go |
Medium |
✔️ |
21 |
Merge Two Sorted Lists |
Go |
Easy |
✔️ |
20 |
Valid Parentheses |
Go |
Easy |
✔️ |
19 |
Remove Nth Node From End of List |
Go |
Medium |
✔️ |
18 |
4Sum |
Go |
Medium |
✔️ |
17 |
Letter Combinations of a Phone Number |
Go |
Medium |
✔️ |
16 |
3Sum Closest |
Go |
Medium |
✔️ |
15 |
3Sum |
Go |
Medium |
✔️ |
14 |
Longest Common Prefix |
Go |
Easy |
✔️ |
13 |
Roman to Integer |
Go |
Easy |
✔️ |
12 |
Integer to Roman |
Go |
Medium |
✔️ |
11 |
Container With Most Water |
Go |
Medium |
✔️ |
10 |
Regular Expression Matching |
Go |
Hard |
✔️ |
9 |
Palindrome Number |
Go |
Easy |
✔️ |
8 |
String to Integer (atoi) |
Go |
Medium |
✔️ |
7 |
Reverse Integer |
Go |
Easy |
✔️ |
6 |
ZigZag Conversion |
Go |
Medium |
✔️ |
5 |
Longest Palindromic Substring |
Go |
Medium |
✔️ |
4 |
Median of Two Sorted Arrays |
Go |
Hard |
✔️ |
3 |
Longest Substring Without Repeating Characters |
Go |
Medium |
✔️ |
2 |
Add Two Numbers |
Go |
Medium |
✔️ |
1 |
Two Sum |
Go |
Easy |
✔️ |