| 1 |
Two Sum |
| 2 |
Add Two Numbers |
| 3 |
Longest Substring Without Repeating Characters |
| 5 |
Longest Palindromic Substring |
| 6 |
ZigZag Conversion |
| 7 |
Reverse Integer |
| 8 |
String to Integer (atoi) |
| 9 |
Palindrome Number |
| 13 |
Roman to Integer |
| 14 |
|
| 15 |
3Sum |
| 16 |
|
| 17 |
Letter Combinations of a Phone Number |
| 18 |
|
| 19 |
Remove Nth Node from the end |
| 20 |
Valid Parenthesis |
| 21 |
Merge Two Sorted Lists |
| 22 |
Generate Parenthesis |
| 23 |
|
| 24 |
Swap nodes in pairs |
| 26 |
|
| 27 |
Remove element |
| 28 |
|
| 31 |
|
| 33 |
Search in Rotated Sorted Array |
| 34 |
Find First and Last Position of Element in Sorted Array |
| 35 |
|
| 36 |
|
| 38 |
|
| 39 |
|
| 42 |
Trapping Rain Water |
| 45 |
Jump Game II |
| 48 |
Rotate Image |
| 49 |
Group Anagrams |
| 50 |
|
| 51 |
|
| 52 |
|
| 53 |
Maximum Subarray |
| 54 |
Spiral Matrix |
| 55 |
Jump Game |
| 56 |
Merge intervals |
| 58 |
Length of Last Word |
| 59 |
|
| 61 |
Rotate List |
| 62 |
Unique Paths |
| 63 |
|
| 64 |
Minimum Path Sum |
| 66 |
|
| 67 |
|
| 69 |
Sqrt(x) |
| 70 |
Climbing Stairs |
| 73 |
|
| 74 |
Search a 2D Matrix |
| 75 |
|
| 78 |
|
| 79 |
|
| 80 |
Remove Duplicates from Sorted Array II |
| 82 |
Remove Duplicates from Sorted List II |
| 83 |
Remove Duplicates from sorted list |
| 84 |
Largest Rectangle in Histogram |
| 85 |
Maximal Rectangle |
| 86 |
Partition List |
| 88 |
Merge Sorted Array |
| 90 |
|
| 91 |
|
| 92 |
Reverse Linked list II |
| 93 |
|
| 94 |
Binary Tree inorder Traversal |
| 95 |
|
| 96 |
Unique binary Search trees |
| 97 |
Interleaving String |
| 98 |
Validate Binary Search Tree |
| 99 |
|
| 100 |
Same Tree |
| 101 |
Symmetric Tree |
| 102 |
Binary tree Level Order Traversal |
| 103 |
Binary tree Zigzag order traversal |
| 104 |
Maximum Depth of Binary Tree |
| 105 |
|
| 107 |
Binary Tree Level order traversal II |
| 108 |
|
| 109 |
|
| 110 |
Balanced Binary Tree |
| 111 |
Minimum Depth of binary Tree |
| 112 |
Path Sum |
| 113 |
|
| 114 |
|
| 116 |
Populating next right pointers in each node |
| 117 |
Populating next right pointers in each node II |
| 118 |
Pascal's Triangle |
| 119 |
|
| 120 |
|
| 121 |
Best Time to Buy and Sell Stock |
| 122 |
Best Time to Buy and Sell Stock II |
| 125 |
|
| 127 |
Word Ladder |
| 130 |
Surrounded Regions |
| 131 |
Palindrome Partitioning |
| 132 |
|
| 133 |
|
| 134 |
Gas Station |
| 136 |
Single Number |
| 137 |
|
| 138 |
Copy List with Random Pointer |
| 139 |
Work Station |
| 141 |
Linked List cycle |
| 142 |
Linked List cycle II |
| 143 |
|
| 144 |
Binary Tree Preorder Traversal |
| 145 |
Binary Tree Postorder Traversal |
| 148 |
Sort List |
| 150 |
|
| 152 |
Maximum Product Subarray |
| 153 |
|
| 155 |
Min Stack |
| 160 |
Intersection of two Linked List |
| 165 |
Compare Version Numbers |
| 167 |
Two Sum II - Input array is sorted |
| 169 |
Majority Element |
| 171 |
|
| 173 |
|
| 175 |
|
| 177 |
|
| 179 |
Largest Number |
| 187 |
|
| 189 |
Rotate Array |
| 190 |
|
| 191 |
Number of 1 bits |
| 198 |
|
| 199 |
Binary Tree Right Side View |
| 200 |
Number of Islands |
| 202 |
Happy Number |
| 203 |
Remove Linked List Elements |
| 204 |
Count Primes |
| 205 |
Isomorphic Strings |
| 206 |
Reverse Linked List |
| 207 |
|
| 209 |
|
| 210 |
|
| 215 |
|
| 216 |
Combinational Sum III |
| 217 |
|
| 220 |
Contains Duplicate |
| 221 |
|
| 225 |
|
| 226 |
Invert Binary Tree |
| 227 |
|
| 228 |
|
| 229 |
|
| 230 |
|
| 231 |
|
| 232 |
|
| 234 |
Palindrome linked list |
| 235 |
Lowest Common Ancestor of a binary tree |
| 237 |
Delete Node of a linked List |
| 238 |
Product of Array Except Self |
| 240 |
Search a 2D Matrix II |
| 241 |
Different ways to add parenthesis |
| 242 |
Valid Anagram |
| 257 |
Binary Tree paths |
| 260 |
|
| 268 |
Missing Number |
| 274 |
|
| 283 |
Move Zeroes |
| 284 |
|
| 287 |
Find the Duplicate Number |
| 290 |
Word Pattern |
| 299 |
Bulls and Cows |
| 300 |
|
| 303 |
|
| 304 |
Range Sum Query 2D - Immutable |
| 318 |
|
| 322 |
Coin change |
| 326 |
|
| 328 |
Odd even linked list |
| 331 |
|
| 332 |
|
| 337 |
House robber III |
| 338 |
Counting bits |
| 341 |
Flatten Nested List Iterator |
| 342 |
|
| 343 |
Integer Break |
| 344 |
|
| 345 |
|
| 347 |
|
| 349 |
|
| 350 |
Intersection of Two Arrays II |
| 367 |
|
| 371 |
|
| 373 |
|
| 378 |
kth smallest element in sorted matrix |
| 383 |
Ransom Note |
| 384 |
|
| 389 |
Find the difference |
| 392 |
Is subsequence |
| 394 |
|
| 402 |
|
| 404 |
|
| 405 |
|
| 406 |
Queue Reconstruction by height |
| 409 |
|
| 412 |
|
| 413 |
Arithmetic Slices |
| 414 |
|
| 415 |
Add strings |
| 416 |
Partition equal subset sum |
| 417 |
|
| 419 |
Battleships in a board |
| 429 |
N-ary Tree Level order Traversal |
| 430 |
Flatten a multilevel doubly linked list |
| 433 |
|
| 435 |
Non overlapping intervals |
| 437 |
|
| 438 |
|
| 442 |
Find all duplicates in an array |
| 443 |
|
| 445 |
Add two numbers |
| 449 |
|
| 451 |
Sort Characters by Frequency |
| 452 |
Minimum number of arrows to burst balloons |
| 456 |
|
| 459 |
Repeated Substring Pattern |
| 461 |
Hamming Distance |
| 463 |
Island Parameter |
| 476 |
|
| 477 |
|
| 482 |
Liscence Key Formatting |
| 485 |
|
| 494 |
Target Sum |
| 495 |
Teemo Attacking |
| 496 |
|
| 498 |
Diagonal Traverse |
| 501 |
Find Mode in Binary Search Tree |
| 503 |
Next Greater Element II |
| 506 |
|
| 507 |
Perfect Number |
| 509 |
Fibonacci Number |
| 524 |
Longest Word in Dictionary through Deleting |
| 516 |
Longest Palindromic Subsequence |
| 518 |
Coin change 2 |
| 520 |
|
| 521 |
|
| 522 |
|
| 524 |
Longest word in dictionary through deleting |
| 526 |
Beautiful Arrangement |
| 530 |
Minimum absolute difference in bst |
| 537 |
|
| 538 |
Convert bst to greater tree |
| 540 |
|
| 541 |
|
| 542 |
|
| 543 |
Diameter of binary tree |
| 547 |
|
| 551 |
Student attendance record i |
| 556 |
|
| 557 |
|
| 559 |
Max Depth of n-ary tree |
| 560 |
|
| 561 |
|
| 563 |
Binary Tree Tilt |
| 566 |
Reshape the Matrix |
| 572 |
Subtree of Another Tree |
| 581 |
|
| 583 |
Delete Operation for Two Strings |
| 589 |
N ary tree preorder traversal |
| 590 |
N ary tree postorder traversal |
| 598 |
|
| 606 |
Construct string from binary tree |
| 617 |
Merge two binary trees |
| 622 |
|
| 628 |
|
| 630 |
Course Schedule III |
| 633 |
|
| 637 |
Average of levels in binary tree |
| 638 |
Shopping offers |
| 640 |
|
| 641 |
Design Circular Deque |
| 643 |
|
| 645 |
|
| 646 |
Maximum length of pair chain |
| 647 |
Palindromic substrings |
| 652 |
|
| 653 |
Two sum IV - Input is a BST |
| 654 |
|
| 657 |
|
| 662 |
Maximum width of binary tree |
| 665 |
Non-decreasing Array |
| 669 |
|
| 671 |
Second minimum node in a binary tree |
| 672 |
|
| 678 |
|
| 680 |
|
| 682 |
Baseball Game |
| 684 |
Redundant Connection |
| 686 |
Repeated string match |
| 687 |
Longest univalue path |
| 690 |
Employee Importance |
| 692 |
Top K Frequent Words |
| 693 |
|
| 695 |
Max area of island |
| 698 |
Partition to k equal sum subsets |
| 700 |
Search in a binary search tree |
| 703 |
Kth Largest Element in a Stream |
| 704 |
|
| 705 |
|
| 706 |
Design HashMap |
| 709 |
To lower case |
| 712 |
Minimum ascii delete sum for two strings |
| 714 |
Best time to buy and sell stock with transaction fee |
| 717 |
|
| 724 |
|
| 733 |
Flood Fill |
| 739 |
|
| 746 |
Min cost climbing stairs |
| 747 |
|
| 763 |
Partition Labels |
| 771 |
Jewels and Stones |
| 783 |
Minimum distance between bst nodes |
| 784 |
|
| 787 |
|
| 788 |
Rotated Digits**** |
| 792 |
Number of matching subsequences |
| 794 |
|
| 796 |
|
| 797 |
All paths from source to target |
| 804 |
Unique Morse Words |
| 813 |
Largest Sum of Averages |
| 814 |
Binary Tree Pruning |
| 817 |
Linked List Components |
| 819 |
Most Common Word |
| 824 |
Goat Latin |
| 832 |
|
| 836 |
|
| 838 |
Push Dominoes |
| 841 |
Keys and Rooms |
| 844 |
Backspace String Compare |
| 845 |
Longest mountain in an array |
| 849 |
|
| 856 |
Score of Parentheses |
| 861 |
Score after flipping matrix |
| 863 |
All Nodes Distance K in Binary Tree |
| 866 |
|
| 868 |
|
| 872 |
Leaf similar trees |
| 876 |
Middle of linked list |
| 877 |
Stone game |
| 890 |
Find and replace pattern |
| 894 |
All possible full binary trees |
| 896 |
Monotonic Array |
| 897 |
Increasing order search tree |
| 905 |
Sort Array by Parity |
| 912 |
Sort an array |
| 915 |
Partition array into disjoint intervals |
| 917 |
|
| 922 |
|
| 925 |
Long Pressed name |
| 926 |
Flip String to monotone increasing |
| 929 |
Unique email address |
| 931 |
Minimum falling path sum |
| 932 |
|
| 937 |
Reorder Data in Log Files |
| 938 |
Range sum of BST |
| 942 |
|
| 944 |
Delete Columns to Make Sorted |
| 945 |
Minimum Increment to Make Array Unique |
| 949 |
Largest Time for given Digits |
| 950 |
Reveal cards in increasing order |
| 951 |
|
| 957 |
Prison Cells After N Days |
| 961 |
N repeated element in size 2n array |
| 965 |
Univalued Binary tree |
| 970 |
Powerful integers |
| 973 |
K Closest Points to Origin |
| 977 |
Squares of a sorted array |
| 978 |
|
| 979 |
Distribute coins in a binary tree |
| 981 |
|
| 983 |
Minimum cost for tickets |
| 986 |
Interval List Interactions |
| 987 |
|
| 989 |
|
| 993 |
|
| 994 |
Rotting Oranges |
| 997 |
Find the town judge |
| 1002 |
|
| 1004 |
Max consecutive ones III |
| 1005 |
|
| 1008 |
Construct binary search tree from preorder traversal |
| 1009 |
|
| 1010 |
|
| 1011 |
|
| 1013 |
|
| 1014 |
Best sightseeing pair |
| 1020 |
|
| 1021 |
Remove Outermost Parentheses |
| 1022 |
Sum of Root To Leaf Binary Numbers |
| 1024 |
Video stiching |
| 1025 |
Divisor game |
| 1026 |
Maximum difference between node and ancestor |
| 1029 |
|
| 1031 |
Maximum sum of two non overlapping subarrays |
| 1035 |
Uncrossed Lines |
| 1037 |
Valid Boomerang |
| 1038 |
Binary search tree to greater sum tree |
| 1043 |
Partition array for maximum sum |
| 1047 |
Remove all adjacent duplicates in string |
| 1048 |
Longest string chain |
| 1078 |
Occurrences After Bigram |
| 1089 |
|
| 1091 |
|
| 1094 |
Car Pooling |
| 1105 |
Filling Bookcase shelves |
| 1108 |
|
| 1110 |
Delete nodes and return forest |
| 1122 |
|
| 1130 |
Minimum cost tree from leaf values |
| 1137 |
Nth Tribonacci Number |
| 1140 |
Stone game II |
| 1143 |
Longest common subsequence |
| 1154 |
Day of the Year |
| 1155 |
|
| 1160 |
|
| 1175 |
|
| 1184 |
|
| 1207 |
|
| 1219 |
|
| 1221 |
Split a String in Balanced Strings |
| 1227 |
Airplane seat assignment probability |
| 1228 |
|
| 1238 |
|
| 1260 |
|
| 1261 |
Find elements in a contaminated binary tree |
| 1275 |
|
| 1277 |
Count square submatrices with all ones |
| 1281 |
Subtract the product and sum of digits of an integer |
| 1287 |
|
| 1290 |
Convert Binary Number in a Linked List to Integer |
| 1302 |
Deepest leaves sum |
| 1305 |
All elements in two binary search trees |
| 1310 |
|
| 1313 |
|
| 1314 |
Matrix block sum |
| 1315 |
Sum of nodes with even valued grandparent |
| 1318 |
|
| 1323 |
Maximum 68 number |
| 1325 |
Delete leaves with a given value |
| 1331 |
|
| 1332 |
|
| 1339 |
|
| 1342 |
|
| 1346 |
|
| 1353 |
|
| 1356 |
|
| 1362 |
Closest Divisors |
| 1365 |
How Many Numbers Are Smaller Than the Current Number |
| 1370 |
|
| 1371 |
|
| 1404 |
|
| 1408 |
|
| 1409 |
|
| 1422 |
|
| 1431 |
Kids With the Greatest Number of Candies |
| 1436 |
|
| 1441 |
|
| 1442 |
|
| 1457 |
|
| 1461 |
|
| 1470 |
Shuffle the Array |
| 1471 |
|
| 1475 |
Final Prices With a Special Discount in a Shop |
| 1476 |
Subrectangle Queries |
| 1480 |
Running Sum of 1d Array |
| 1481 |
Least Number of Unique Integers after K Removals |
| 1486 |
XOR Operation in an Array |
| 1488 |
|
| 1493 |
Longest Subarray of 1's After Deleting One Element |
| 1496 |
|
| 1498 |
|
| 1501 |
|
| 1502 |
|
| 1508 |
Range Sum of Sorted Subarray Sums |
| 1509 |
Minimum Difference Between Largest and Smallest Value in Three Moves |
| 1512 |
Number of good pairs |
| 1513 |
|
| 1525 |
Number of Good Ways to Split a String |
| 1529 |
Bulb Switcher IV |
| 1534 |
Count Good Triplets |
| 1539 |
Kth Missing Positive Number |
| 1544 |
Make The String Great |
| 1546 |
|
| 1550 |
Three Consecutive Odds |
| 1572 |
Matrix Diagonal Sum |
| 1582 |
Special Positions in a Binary Matrix |
| 1588 |
Sum of All Odd Length Subarrays |
| 1590 |
Make Sum Divisible by P |
| 1624 |
Largest Substring Between Two Equal Characters |
| 1629 |
|
| 1640 |
Check Array Formation Through Concatenation |
| 1652 |
Defuse the Bomb |
| 1656 |
Design an Ordered Stream |
| 1672 |
Richest Customer Wealth |
| 1680 |
|
| 1684 |
Count the Number of Consistent Strings |
| 1688 |
Count of Matches in Tournament |
| 1701 |
Average Waiting Time |
| 1704 |
Determine if String Halves Are Alike |
| 1725 |
Number Of Rectangles That Can Form The Largest Square |
| 1726 |
Tuple with Same Product |
| 1732 |
Find the Highest Altitude |
| 1734 |
|
| 1738 |
|
| 1742 |
|
| 1763 |
|
| 1764 |
Form Array by Concatenating Subarrays of Another Array |
| 1768 |
Merge Strings Alternately |
| 1769 |
Minimum Number of Operations to Move All Balls to Each Box |
| 1773 |
Count Items Matching a Rule |
| 1790 |
Check if One String Swap Can Make Strings Equal |
| 1796 |
Second Largest Digit in a String |
| 1800 |
Maximum Ascending Subarray Sum |
| 1812 |
Determine Color of a Chessboard Square |
| 1816 |
Truncate Sentence |
| 1822 |
Sign of the Product of an Array |
| 1823 |
Find the Winner of the Circular Game |
| 1827 |
Minimum Operations to Make the Array Increasing |
| 1829 |
|
| 1832 |
Check if the Sentence Is Pangram |
| 1833 |
Maximum Ice Cream Bars |
| 1837 |
Sum of Digits in Base K |
| 1839 |
Longest Substring Of All Vowels in Order |
| 1863 |
|
| 1941 |
Check if All Characters Have Equal Number of Occurrences |
| 1942 |
The Number of the Smallest Unoccupied Chair |
| 1943 |
Describe the painting |
| 1947 |
|