1 |
Two Sum |
java |
Easy |
2 |
First Unique Character in a String |
not-yet |
Easy |
3 |
Add Binary |
not-yet |
Easy |
4 |
Reverse Linked List |
not-yet |
Easy |
5 |
Reverse Integer |
not-yet |
Easy |
6 |
Palindrome Number |
not-yet |
Easy |
7 |
Search Insert Position |
not-yet |
Easy |
8 |
Largest Perimeter Triangle |
not-yet |
Easy |
9 |
Roman to Integer |
not-yet |
Easy |
10 |
Longest Common Prefix |
not-yet |
Easy |
11 |
Valid Parentheses |
not-yet |
Easy |
12 |
Merge Two Sorted Lists |
not-yet |
Easy |
13 |
Remove Duplicates from Sorted Array |
not-yet |
Easy |
14 |
Remove Element |
not-yet |
Easy |
15 |
Implement strStr() |
not-yet |
Easy |
16 |
Maximum Subarray |
not-yet |
Easy |
17 |
Length of Last Word |
not-yet |
Easy |
18 |
Plus One |
not-yet |
Easy |
19 |
Sqrt(x) |
not-yet |
Easy |
20 |
Climbing Stairs |
not-yet |
Easy |
21 |
Remove Duplicates from Sorted List |
not-yet |
Easy |
22 |
Merge Sorted Array |
not-yet |
Easy |
23 |
Same Tree |
not-yet |
Easy |
24 |
Symmetric Tree |
not-yet |
Easy |
25 |
Maximum Depth of Binary Tree |
not-yet |
Easy |
26 |
Binary Tree Level Order Traversal II |
not-yet |
Easy |
27 |
Convert Sorted Array to Binary Search Tree |
not-yet |
Easy |
28 |
Linked List Cycle |
not-yet |
Easy |
29 |
Min Stack |
not-yet |
Easy |
30 |
Intersection of Two Linked Lists |
not-yet |
Easy |
31 |
Two Sum II - Input array is sorted |
not-yet |
Easy |
32 |
Excel Sheet Column Title |
not-yet |
Easy |
33 |
Excel Sheet Column Number |
not-yet |
Easy |
34 |
Factorial Trailing Zeroes |
not-yet |
Easy |
35 |
Unique Number of Occurrences |
not-yet |
Easy |
36 |
Print in Order |
not-yet |
Easy |
37 |
Pairs of Songs With Total Durations Divisible by 60 |
not-yet |
Easy |
38 |
Single Number |
not-yet |
Easy |
39 |
Valid Palindrome |
not-yet |
Easy |
40 |
Best Time to Buy and Sell Stock |
not-yet |
Easy |
41 |
Best Time to Buy and Sell Stock II |
not-yet |
Easy |
42 |
Pascal's Triangle |
not-yet |
Easy |
43 |
Pascal's Triangle II |
not-yet |
Easy |
44 |
Minimum Depth of Binary Tree |
not-yet |
Easy |
45 |
Balanced Binary Tree |
not-yet |
Easy |
46 |
Count and Say |
not-yet |
Easy |
47 |
Reverse String |
not-yet |
Easy |
48 |
Fizz Buzz |
not-yet |
Easy |
49 |
Delete Node in a Linked List |
not-yet |
Easy |
50 |
Majority Element |
not-yet |
Easy |
51 |
Contains Duplicate |
not-yet |
Easy |
52 |
Missing Number |
not-yet |
Easy |
53 |
Sum of Two Integers |
not-yet |
Easy |
54 |
Intersection of Two Arrays II |
not-yet |
Easy |
55 |
Count Primes |
not-yet |
Easy |
56 |
Rotate Array |
not-yet |
Easy |
57 |
Reverse Bits |
not-yet |
Easy |
58 |
Shortest Unsorted Continuous Subarray |
not-yet |
Easy |
59 |
Merge Two Binary Tree |
not-yet |
Easy |
60 |
Invert Binary Tree |
not-yet |
Easy |
61 |
Find All Numbers Disappeared in an Array |
not-yet |
Easy |
62 |
Path Sum |
not-yet |
Easy |
63 |
Path Sum II |
not-yet |
Easy |
64 |
Path Sum III |
not-yet |
Easy |
65 |
House Robber |
not-yet |
Easy |
66 |
Palindrome Linked List |
not-yet |
Easy |
67 |
ZigZag Conversion |
not-yet |
Easy |
68 |
Remove Nth Node From End of List |
not-yet |
Easy |
69 |
Swap Nodes in Pairs |
not-yet |
Easy |
70 |
Valid Sudoku |
not-yet |
Easy |
72 |
Read N Characters Given Read4 |
not-yet |
Easy |
73 |
Implement Stack using Queues |
not-yet |
Easy |
74 |
Implement Queue using Stacks |
not-yet |
Easy |
75 |
Bulls and Cows |
not-yet |
Easy |
76 |
Strobogrammatic Number |
not-yet |
Easy |
77 |
Number of Boomerangs |
not-yet |
Easy |
78 |
First Bad Version |
not-yet |
Easy |
79 |
Binary Tree Paths |
not-yet |
Easy |
80 |
Longest Palindrome |
not-yet |
Easy |
81 |
Number of Segments in a String |
not-yet |
Easy |
82 |
Power of Four |
not-yet |
Easy |
83 |
Power of Two |
not-yet |
Easy |
84 |
Add Strings |
not-yet |
Easy |
85 |
Nested List Weight Sum II |
not-yet |
Easy |
86 |
Reverse Vowels of a String |
not-yet |
Easy |
87 |
Valid Perfect Square |
not-yet |
Easy |
88 |
Ransom Note |
not-yet |
Easy |
89 |
Find the Difference |
not-yet |
Easy |
90 |
Binary Watch |
not-yet |
Easy |
91 |
Sum of Left Leaves |
not-yet |
Easy |
92 |
Convert a Number to Hexadecimal |
not-yet |
Easy |
93 |
willAdd |
not-yet |
Easy |
94 |
willAdd |
not-yet |
Easy |
95 |
willAdd |
not-yet |
Easy |
96 |
willAdd |
not-yet |
Easy |
97 |
willAdd |
not-yet |
Easy |
98 |
willAdd |
not-yet |
Easy |
99 |
willAdd |
not-yet |
Easy |
100 |
willAdd |
not-yet |
Easy |
--- |
------------------------ |
------ |
----- |
101 |
Find K Closest Elements |
not-yet |
Medium |
102 |
Find All Anagrams in a String |
not-yet |
Medium |
103 |
Add Two Numbers |
not-yet |
Medium |
104 |
Add Two Numbers II |
not-yet |
Medium |
105 |
Vertical Order Traversal of a Binary Tree |
not-yet |
Medium |
106 |
Subarray Sum Equals K |
not-yet |
Medium |
107 |
Course Schedule |
not-yet |
Medium |
108 |
Continuous Subarray Sum |
not-yet |
Medium |
109 |
Battleships in a Board |
not-yet |
Medium |
110 |
Number of Islands |
not-yet |
Medium |
111 |
Largest Sum of Averages |
not-yet |
Medium |
112 |
willAdd |
not-yet |
Medium |
113 |
willAdd |
not-yet |
Medium |
114 |
willAdd |
not-yet |
Medium |
115 |
willAdd |
not-yet |
Medium |
116 |
willAdd |
not-yet |
Medium |
117 |
willAdd |
not-yet |
Medium |
118 |
willAdd |
not-yet |
Medium |
119 |
willAdd |
not-yet |
Medium |
120 |
willAdd |
not-yet |
Medium |
121 |
willAdd |
not-yet |
Medium |
122 |
willAdd |
not-yet |
Medium |
123 |
willAdd |
not-yet |
Medium |
124 |
willAdd |
not-yet |
Medium |
125 |
willAdd |
not-yet |
Medium |
126 |
willAdd |
not-yet |
Medium |
127 |
willAdd |
not-yet |
Medium |
128 |
willAdd |
not-yet |
Medium |
129 |
willAdd |
not-yet |
Medium |
130 |
willAdd |
not-yet |
Medium |
131 |
willAdd |
not-yet |
Medium |
132 |
willAdd |
not-yet |
Medium |
133 |
willAdd |
not-yet |
Medium |
134 |
willAdd |
not-yet |
Medium |
135 |
willAdd |
not-yet |
Medium |
136 |
willAdd |
not-yet |
Medium |
137 |
willAdd |
not-yet |
Medium |
138 |
willAdd |
not-yet |
Medium |
139 |
willAdd |
not-yet |
Medium |
140 |
willAdd |
not-yet |
Medium |
141 |
willAdd |
not-yet |
Medium |
142 |
willAdd |
not-yet |
Medium |
143 |
willAdd |
not-yet |
Medium |
144 |
willAdd |
not-yet |
Medium |
145 |
willAdd |
not-yet |
Medium |
146 |
willAdd |
not-yet |
Medium |
147 |
willAdd |
not-yet |
Medium |
148 |
willAdd |
not-yet |
Medium |
149 |
willAdd |
not-yet |
Medium |
150 |
willAdd |
not-yet |
Medium |
151 |
willAdd |
not-yet |
Medium |
152 |
willAdd |
not-yet |
Medium |
153 |
willAdd |
not-yet |
Medium |
154 |
willAdd |
not-yet |
Medium |
155 |
willAdd |
not-yet |
Medium |
156 |
willAdd |
not-yet |
Medium |
157 |
willAdd |
not-yet |
Medium |
158 |
willAdd |
not-yet |
Medium |
159 |
willAdd |
not-yet |
Medium |
160 |
willAdd |
not-yet |
Medium |
161 |
willAdd |
not-yet |
Medium |
162 |
willAdd |
not-yet |
Medium |
163 |
willAdd |
not-yet |
Medium |
164 |
willAdd |
not-yet |
Medium |
165 |
willAdd |
not-yet |
Medium |
166 |
willAdd |
not-yet |
Medium |
167 |
willAdd |
not-yet |
Medium |
168 |
willAdd |
not-yet |
Medium |
169 |
willAdd |
not-yet |
Medium |
170 |
willAdd |
not-yet |
Medium |
--- |
------------------------ |
------ |
----- |
171 |
willAdd |
not-yet |
Hard |
172 |
willAdd |
not-yet |
Hard |
173 |
willAdd |
not-yet |
Hard |
174 |
willAdd |
not-yet |
Hard |
175 |
willAdd |
not-yet |
Hard |
176 |
willAdd |
not-yet |
Hard |
177 |
willAdd |
not-yet |
Hard |
178 |
willAdd |
not-yet |
Hard |
179 |
willAdd |
not-yet |
Hard |
180 |
willAdd |
not-yet |
Hard |