1 |
Two Sum |
Solution |
Easy |
2 |
Add Two Numbers |
Solution |
Medium |
3 |
Longest Substring Without Repeating Characters |
Solution |
Medium |
4 |
Median of Two Sorted Arrays |
Solution |
Hard |
5 |
Longest Palindromic Substring |
Solution |
Medium |
6 |
Zigzag Conversion |
Solution |
Medium |
7 |
Reverse Integer |
Solution |
Medium |
9 |
Palindrome Number |
Solution |
Easy |
11 |
Container With Most Water |
Solution |
Medium |
12 |
Integer to Roman |
Solution |
Medium |
13 |
Roman to Integer |
Solution |
Easy |
14 |
Longest Common Prefix |
Solution |
Easy |
15 |
3Sum |
Solution |
Medium |
16 |
3Sum Closest |
Solution |
Medium |
17 |
Letter Combinations of a Phone Number |
Solution |
Medium |
19 |
Remove Nth Node From End of List |
Solution |
Medium |
22 |
Generate Parentheses |
Solution |
Medium |
25 |
Reverse Nodes in k-Group |
Solution |
Hard |
27 |
Remove Element |
Solution |
Easy |
42 |
Trapping Rain Water |
Solution |
Hard |
45 |
Jump Game II |
Solution |
Medium |
46 |
Permutations |
Solution |
Medium |
48 |
Rotate Image |
Solution |
Medium |
51 |
N-Queens |
Solution |
Hard |
53 |
Maximum Subarray |
Solution |
Medium |
55 |
Jump Game |
Solution |
Medium |
58 |
Length of Last Word |
Solution |
Easy |
61 |
Rotate List |
Solution |
Medium |
62 |
Unique Paths |
Solution |
Medium |
63 |
Unique Paths II |
Solution |
Medium |
64 |
Minimum Path Sum |
Solution |
Medium |
72 |
Edit Distance |
Solution |
Medium |
80 |
Remove Duplicates from Sorted Array II |
Solution |
Medium |
83 |
Remove Duplicates from Sorted List |
Solution |
Easy |
86 |
Partition List |
Solution |
Medium |
95 |
Unique Binary Search Trees II |
Solution |
Medium |
98 |
Validate Binary Search Tree |
Solution |
Medium |
101 |
Symmetric Tree |
Solution |
Easy |
103 |
Binary Tree Zigzag Level Order Traversal |
Solution |
Medium |
104 |
Maximum Depth of Binary Tree |
Solution |
Easy |
106 |
Construct Binary Tree from Inorder and Postorder Traversal |
Solution |
Medium |
107 |
Binary Tree Level Order Traversal II |
Solution |
Medium |
112 |
Path Sum |
Solution |
Easy |
114 |
Flatten Binary Tree to Linked List |
Solution |
Medium |
116 |
Populating Next Right Pointers in Each Node |
Solution |
Medium |
118 |
Pascal's Triangle |
Solution |
Easy |
120 |
Triangle |
Solution |
Medium |
121 |
Best Time to Buy and Sell Stock |
Solution |
Easy |
125 |
Valid Palindrome |
Solution |
Easy |
139 |
Word Break |
Solution |
Medium |
144 |
Binary Tree Preorder Traversal |
Solution |
Easy |
146 |
LRU Cache |
Solution |
Medium |
151 |
Reverse Words in a String |
Solution |
Medium |
165 |
Compare Version Numbers |
Solution |
Medium |
167 |
Two Sum II - Input Array Is Sorted |
Solution |
Medium |
189 |
Rotate Array |
Solution |
Medium |
198 |
House Robber |
Solution |
Medium |
199 |
Binary Tree Right Side View |
Solution |
Medium |
202 |
Happy Number |
Solution |
Easy |
205 |
Isomorphic Strings |
Solution |
Easy |
206 |
Reverse Linked List |
Solution |
Easy |
221 |
Maximal Square |
Solution |
Medium |
222 |
Count Complete Tree Nodes |
Solution |
Medium |
226 |
Invert Binary Tree |
Solution |
Easy |
230 |
Kth Smallest Element in a BST |
Solution |
Medium |
236 |
Lowest Common Ancestor of a Binary Tree |
Solution |
Medium |
238 |
Product of Array Except Self |
Solution |
Medium |
290 |
Word Pattern |
Solution |
Easy |
300 |
Longest Increasing Subsequence |
Solution |
Medium |
303 |
Range Sum Query - Immutable |
Solution |
Easy |
322 |
Coin Change |
Solution |
Medium |
334 |
Increasing Triplet Subsequence |
Solution |
Medium |
345 |
Reverse Vowels of a String |
Solution |
Easy |
374 |
Guess Number Higher or Lower |
Solution |
Easy |
392 |
Is Subsequence |
Solution |
Easy |
437 |
Path Sum III |
Solution |
Medium |
443 |
String Compression |
Solution |
Medium |
523 |
Continuous Subarray Sum |
Solution |
Medium |
530 |
Minimum Absolute Difference in BST |
Solution |
Easy |
563 |
Binary Tree Tilt |
Solution |
Easy |
623 |
Add One Row to Tree |
Solution |
Medium |
637 |
Average of Levels in Binary Tree |
Solution |
Easy |
643 |
Maximum Average Subarray I |
Solution |
Easy |
653 |
Two Sum IV - Input is a BST |
Solution |
Easy |
654 |
Maximum Binary Tree |
Solution |
Medium |
655 |
Print Binary Tree |
Solution |
Medium |
680 |
Valid Palindrome II |
Solution |
Easy |
747 |
Min Cost Climbing Stairs |
Solution |
Easy |
904 |
Leaf-Similar Trees |
Solution |
Easy |
967 |
Minimum Falling Path Sum |
Solution |
Medium |
1046 |
Max Consecutive Ones III |
Solution |
Medium |
1146 |
Greatest Common Divisor of Strings |
Solution |
Easy |
1236 |
N-th Tribonacci Number |
Solution |
Easy |
1392 |
Find the Difference of Two Arrays |
Solution |
Easy |
1474 |
Longest ZigZag Path in a Binary Tree |
Solution |
Medium |
1544 |
Count Good Nodes in Binary Tree |
Solution |
Medium |
1567 |
Maximum Number of Vowels in a Substring of Given Length |
Solution |
Medium |
1693 |
Sum of All Odd Length Subarrays |
Solution |
Easy |
1798 |
Max Number of K-Sum Pairs |
Solution |
Medium |
1894 |
Merge Strings Alternately |
Solution |
Easy |
2265 |
Partition Array According to Given Pivot |
Solution |
Medium |
2728 |
Sum in a Matrix |
Solution |
Medium |