| 1 |
Two Sum |
TS SW |
Easy |
| 2 |
Add Two Numbers |
TS |
Medium |
| 3 |
Longest Substring Without Repeating Characters |
TS |
Medium |
| 6 |
ZigZag Conversion |
TS |
Medium |
| 7 |
Reverse Integer |
TS |
Easy |
| 8 |
String to Integer (atoi) |
TS |
Medium |
| 9 |
Palindrome Number |
TS |
Easy |
| 12 |
Integer to Roman |
TS |
Medium |
| 13 |
Roman to Integer |
TS |
Easy |
| 14 |
Longest Common Prefix |
TS |
Easy |
| 20 |
Valid Parentheses |
TS |
Easy |
| 26 |
Remove Duplicates from Sorted Array |
TS |
Easy |
| 28 |
Implement strStr() |
TS |
Easy |
| 38 |
Count and Say |
TS |
Medium |
| 48 |
Rotate Image |
TS |
Medium |
| 58 |
Length of Last Word |
TS |
Easy |
| 67 |
Add Binary |
TS |
Easy |
| 92 |
Reverse Linked List II |
TS |
Medium |
| 94 |
Binary Tree Inorder Traversal |
TS |
Medium |
| 98 |
Validate Binary Search Tree |
TS |
Medium |
| 100 |
Same Tree |
TS |
Easy |
| 101 |
Symmetric Tree |
TS |
Easy |
| 102 |
Binary Tree Level Order Traversal |
TS |
Medium |
| 103 |
Binary Tree Zigzag Level Order Traversal |
TS |
Medium |
| 104 |
Maximum Depth of Binary Tree |
TS |
Easy |
| 107 |
Binary Tree Level Order Traversal II |
TS |
Medium |
| 108 |
Convert Sorted Array to Binary Search Tree |
TS |
Easy |
| 110 |
Balanced Binary Tree |
TS |
Easy |
| 111 |
Minimum Depth of Binary Tree |
TS |
Easy |
| 112 |
Path Sum |
TS |
Easy |
| 113 |
Path Sum II |
TS |
Medium |
| 114 |
Flatten Binary Tree to Linked List |
TS |
Medium |
| 118 |
Pascal's Triangle |
TS |
Easy |
| 125 |
Valid Palindrome |
TS |
Easy |
| 129 |
Sum Root to Leaf Numbers |
TS |
Medium |
| 133 |
Clone Graph |
TS |
Medium |
| 144 |
Binary Tree Preorder Traversal |
TS |
Easy |
| 151 |
Reverse Words in a String |
TS |
Medium |
| 165 |
Compare Version Numbers |
TS |
Medium |
| 168 |
Excel Sheet Column Title |
TS |
Easy |
| 173 |
Binary Search Tree Iterator |
TS |
Medium |
| 222 |
Count Complete Tree Nodes |
TS |
Medium |
| 224 |
Basic Calculator |
TS |
Hard |
| 226 |
Invert Binary Tree |
TS |
Easy |
| 230 |
Kth Smallest Element in a BST |
TS |
Medium |
| 257 |
Binary Tree Paths |
TS |
Easy |
| 284 |
Peeking Iterator |
TS |
Medium |
| 344 |
Reverse String |
TS |
Easy |
| 385 |
Mini Parser |
TS |
Medium |
| 394 |
Decode String |
TS |
Medium |
| 404 |
Sum of Left Leaves |
TS |
Easy |
| 412 |
Fizz Buzz |
TS SW |
Easy |
| 415 |
Add Strings |
TS SW |
Easy |
| 429 |
N-ary Tree Level Order Traversal |
TS |
Medium |
| 509 |
Fibonacci Number |
TS |
Easy |
| 513 |
Find Bottom Left Tree Value |
TS |
Medium |
| 515 |
Find Largest Value in Each Tree Row |
TS |
Medium |
| 541 |
Reverse String II |
TS |
Easy |
| 557 |
Reverse Words in a String III |
TS |
Easy |
| 559 |
Maximum Depth of N-ary Tree |
TS |
Easy |
| 589 |
N-ary Tree Preorder Traversal |
TS |
Easy |
| 590 |
N-ary Tree Postorder Traversal |
TS |
Easy |
| 637 |
Average of Levels in Binary Tree |
TS |
Easy |
| 671 |
Second Minimum Node In a Binary Tree |
TS |
Easy |
| 700 |
Search in a Binary Search Tree |
TS |
Easy |
| 792 |
Number of Matching Subsequences |
TS |
Medium |
| 872 |
Leaf-Similar Trees |
TS |
Easy |
| 897 |
Increasing Order Search Tree |
TS |
Easy |
| 901 |
Find Mode in Binary Search Tree |
TS |
Easy |
| 938 |
Range Sum of BST |
TS |
Easy |
| 965 |
Univalued Binary Tree |
TS |
Easy |
| 988 |
Smallest String Starting From Leaf |
TS |
Medium |
| 993 |
Cousins in Binary Tree |
TS |
Easy |
| 1022 |
Sum of Root To Leaf Binary Numbers |
TS |
Easy |
| 1859 |
Sorting the Sentence |
TS |
Easy |