1 |
Two Sum |
Array, Hash Table |
7 |
Reverse Integer |
Math |
9 |
Palindrome Number |
Math |
13 |
Roman to Integer |
Math, String |
14 |
Longest Common Prefix |
String |
20 |
Valid Parentheses |
Stack, String |
21 |
Merge Two Sorted Lists |
Linked List |
26 |
Remove Duplicates from Sorted Array |
Array, Two Pointers |
27 |
Remove Element |
Array, Two Pointers |
28 |
Implement strStr() |
Two Pointers, String |
35 |
Search Insert Position |
String |
38 |
Count and Say |
String |
53 |
Maximum Subarray |
Array, Dynamic Programming, Divide and Conquer |
58 |
Length of Last Word |
String |
66 |
Plus One |
Array, Math |
67 |
Add Binary |
Math, String |
69 |
Sqrt(x) |
Binary Search, Math |
70 |
Climbing Stairs |
Dynamic Programming |
83 |
Remove Duplicates from Sorted List |
Linked List |
88 |
Merge Sorted Array |
Array, Two Pointers |
100 |
Same Tree |
Tree, Depth-first Search |
101 |
Symmetric Tree |
Tree, Depth-first Search, Breadth-first Search |
104 |
Maximum Depth of Binary Tree |
Tree, Depth-first Search |
107 |
Binary Tree Level Order Traversal II |
Tree, Breadth-first Search |
108 |
Convert Sorted Array to Binary Search Tree |
Tree, Depth-first Search |
110 |
Balanced Binary Tree |
Tree, Depth-first Search |
111 |
Minimum Depth of Binary Tree |
Tree, Depth-first Search, Breadth-first Search |
112 |
Path Sum |
Tree, Depth-first Search |
118 |
Pascal's Triangle |
Array |
119 |
Pascal's Triangle II |
Array |
121 |
Best Time to Buy and Sell Stock |
Array, Dynamic Programmin |
122 |
Best Time to Buy and Sell Stock II |
Array, Greedy |
543 |
Diameter of Binary Tree |
Tree |