001 |
Two Sum |
![](src/done.png) |
![](src/done.png) |
Notes |
002 |
Add Two Numbers |
![](src/done.png) |
![](src/done.png) |
Notes |
003 |
Longest Substring Without Repeating Charac... |
![](src/done.png) |
![](src/done.png) |
Notes |
004 |
Median of Two Sorted Arrays |
![](src/yet.png) |
![](src/done.png) |
Notes |
005 |
Longest Palindromic Substring |
![](src/yet.png) |
![](src/done.png) |
Notes |
006 |
ZigZag Conversion |
![](src/done.png) |
![](src/done.png) |
Notes |
007 |
Reverse Integer |
![](src/done.png) |
![](src/done.png) |
Notes |
008 |
String to Integer (atoi) |
![](src/yet.png) |
![](src/done.png) |
Notes |
009 |
Palindrome Number |
![](src/yet.png) |
![](src/done.png) |
Notes |
010 |
Regular Expression Matching |
![](src/yet.png) |
![](src/done.png) |
Notes |
011 |
Container With Most Water |
![](src/done.png) |
![](src/done.png) |
Notes |
012 |
Integer to Roman |
![](src/yet.png) |
![](src/done.png) |
Notes |
013 |
Roman to Integer |
![](src/yet.png) |
![](src/done.png) |
Notes |
014 |
Longest Common Prefix |
![](src/done.png) |
![](src/done.png) |
Coming soon |
015 |
3Sum |
![](src/done.png) |
![](src/done.png) |
Notes |
016 |
3Sum Closest |
![](src/yet.png) |
![](src/yet.png) |
Notes |
017 |
Letter Combinations of a Phone Number |
![](src/done.png) |
![](src/yet.png) |
Notes |
018 |
4Sum |
![](src/done.png) |
![](src/yet.png) |
Notes |
019 |
Remove Nth Node From End of List |
![](src/done.png) |
![](src/done.png) |
Notes |
020 |
Valid Parentheses |
![](src/yet.png) |
![](src/done.png) |
Notes |
021 |
Merge Two Sorted Lists |
![](src/yet.png) |
![](src/done.png) |
Notes |
022 |
Generate Parentheses |
![](src/done.png) |
![](src/done.png) |
Notes |
023 |
Merge k Sorted Lists |
![](src/done.png) |
![](src/yet.png) |
Notes |
024 |
Swap Nodes in Pairs |
![](src/done.png) |
![](src/done.png) |
Notes |
025 |
Reverse Nodes in k-Group |
![](src/done.png) |
![](src/done.png) |
Notes |
026 |
Remove Duplicates from Sorted Array |
![](src/yet.png) |
![](src/done.png) |
Notes |
027 |
Remove Element |
![](src/yet.png) |
![](src/done.png) |
Notes |
028 |
Implement strStr() |
![](src/done.png) |
![](src/done.png) |
Notes |
029 |
Divide Two Integers |
![](src/yet.png) |
![](src/yet.png) |
Notes |
030 |
Substring with Concatenation of All Words |
![](src/done.png) |
![](src/yet.png) |
Notes |
031 |
Next Permutation |
![](src/yet.png) |
![](src/yet.png) |
Notes |
032 |
Longest Valid Parentheses |
![](src/done.png) |
![](src/done.png) |
Notes |
033 |
Search in Rotated Sorted Array |
![](src/yet.png) |
![](src/yet.png) |
Notes |
034 |
Search for a Range |
![](src/done.png) |
![](src/yet.png) |
Notes |
035 |
Search Insert Position |
![](src/done.png) |
![](src/done.png) |
Notes |
036 |
Valid Sudoku |
![](src/yet.png) |
![](src/yet.png) |
Notes |
037 |
Sudoku Solver |
![](src/yet.png) |
![](src/yet.png) |
Notes |
038 |
Count and Say |
![](src/yet.png) |
![](src/yet.png) |
Notes |
039 |
Combination Sum |
![](src/yet.png) |
![](src/yet.png) |
Notes |
040 |
Combination Sum II |
![](src/yet.png) |
![](src/yet.png) |
Notes |
041 |
First Missing Positive |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
042 |
Trapping Rain Water |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
043 |
Multiply Strings |
![](src/done.png) |
![](src/done.png) |
Notes |
044 |
Wildcard Matching |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
045 |
Jump Game II |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
046 |
Permutations |
![](src/done.png) |
![](src/done.png) |
Notes |
047 |
Permutations II |
![](src/done.png) |
![](src/done.png) |
Notes |
048 |
Rotate Image |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
049 |
Group Anagrams |
![](src/done.png) |
![](src/done.png) |
Coming soon |
050 |
Pow(x,n) |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
051 |
N-Queens |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
052 |
N-Queens II |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
053 |
Maximum Subarray |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
054 |
Spiral Matrix |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
055 |
Jump Game |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
056 |
Merge Intervals |
![](src/done.png) |
![](src/done.png) |
Notes |
057 |
Insert Interval |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
058 |
Length of Last Word |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
059 |
Spiral Matrix II |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
060 |
Permutation Sequence |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
061 |
Rotate List |
![](src/done.png) |
![](src/done.png) |
Notes |
062 |
Unique Paths |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
063 |
Unique Paths II |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
064 |
Minimum Path Sum |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
065 |
Valid Number |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
066 |
Plus One |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
067 |
Add Binary |
![](src/done.png) |
![](src/done.png) |
Coming soon |
068 |
Text Justification |
![](src/yet.png) |
![](src/yet.png) |
Notes |
069 |
Sqrt(x) |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
070 |
Climbing Stairs |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
071 |
Simplify Path |
![](src/yet.png) |
![](src/done.png) |
Notes |
072 |
Edit Distance |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
073 |
Set Matrix Zeroes |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
074 |
Search a 2D Matrix |
![](src/done.png) |
![](src/done.png) |
Notes |
075 |
Sort Colors |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
076 |
Minimum Window Substring |
![](src/done.png) |
![](src/yet.png) |
Notes |
077 |
Combinations |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
078 |
Subsets |
![](src/done.png) |
![](src/done.png) |
Notes |
079 |
Word Search |
![](src/done.png) |
![](src/done.png) |
Notes |
080 |
Remove Duplicates from Sorted Array II |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
081 |
Search in Rotated Sorted Array II |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
082 |
Remove Duplicates from Sorted List II |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
083 |
Remove Duplicates from Sorted List |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
084 |
Largest Rectangle in Histogram |
![](src/yet.png) |
![](src/yet.png) |
Notes |
085 |
Maximal Rectangle |
![](src/yet.png) |
![](src/yet.png) |
Notes |
086 |
Partition List |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
087 |
Scramble String |
![](src/yet.png) |
![](src/yet.png) |
Notes |
088 |
Merge Sorted Array |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
089 |
Gray Code |
![](src/done.png) |
![](src/yet.png) |
Notes |
090 |
Subsets II |
![](src/yet.png) |
![](src/done.png) |
Notes |
091 |
Decode Ways |
![](src/done.png) |
![](src/done.png) |
Notes |
092 |
Reverse Linked List II |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
093 |
Restore IP Addresses |
![](src/done.png) |
![](src/yet.png) |
Notes |
094 |
Binary Tree Inorder Traversal |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
095 |
Unique Binary Search Trees II |
![](src/yet.png) |
![](src/yet.png) |
Notes |
096 |
Unique Binary Search Trees |
![](src/done.png) |
![](src/done.png) |
Notes |
097 |
Interleaving String |
![](src/done.png) |
![](src/yet.png) |
Notes |
098 |
Validate Binary Search Tree |
![](src/done.png) |
![](src/yet.png) |
Notes |
099 |
Recover Binary Search Tree |
![](src/yet.png) |
![](src/yet.png) |
Notes |
100 |
Same Tree |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
101 |
Symmetric Tree |
![](src/done.png) |
![](src/done.png) |
Notes |
102 |
Binary Tree Level Order Traversal |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
103 |
Binary Tree Zigzag Level Order Traversal |
![](src/yet.png) |
![](src/yet.png) |
Notes |
104 |
Maximum Depth of Binary Tree |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
105 |
Construct Binary Tree from Preorder and In... |
![](src/yet.png) |
![](src/yet.png) |
Notes |
106 |
Construct Binary Tree from Inorder and Pos... |
![](src/yet.png) |
![](src/yet.png) |
Notes |
107 |
Binary Tree Level Order Traversal II |
![](src/done.png) |
![](src/yet.png) |
Notes |
108 |
Convert Sorted Array to Binary Search Tree |
![](src/yet.png) |
![](src/yet.png) |
Notes |
109 |
Convert Sorted List to Binary Search Tree |
![](src/done.png) |
![](src/yet.png) |
Notes |
110 |
Balanced Binary Tree |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
111 |
Minimum Depth of Binary Tree |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
112 |
Path Sum |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
113 |
Path Sum II |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
114 |
Flatten Binary Tree to Linked List |
![](src/done.png) |
![](src/yet.png) |
Notes |
115 |
Distinct Subsequences |
![](src/done.png) |
![](src/yet.png) |
Notes |
116 |
Populating Next Right Pointers in Each Node |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
117 |
Populating Next Right Pointers in Each Nod... |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
118 |
Pascal's Triangle |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
119 |
Pascal's Triangle II |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
120 |
Triangle |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
121 |
Best Time to Buy and Sell Stock |
![](src/done.png) |
![](src/yet.png) |
Notes |
122 |
Best Time to Buy and Sell Stock II |
![](src/yet.png) |
![](src/done.png) |
Notes |
123 |
Best Time to Buy and Sell Stock III |
![](src/yet.png) |
![](src/yet.png) |
Notes |
124 |
Binary Tree Maximum Path Sum |
![](src/yet.png) |
![](src/yet.png) |
Notes |
125 |
Valid Palindrome |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
126 |
Word Ladder II |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
127 |
Word Ladder |
![](src/done.png) |
![](src/yet.png) |
Notes |
128 |
Longest Consecutive Sequence |
![](src/done.png) |
![](src/done.png) |
Coming soon |
129 |
Sum Root to Leaf Numbers |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
130 |
Surrounded Regions |
![](src/done.png) |
![](src/done.png) |
Notes |
131 |
Palindrome Partitioning |
![](src/yet.png) |
![](src/yet.png) |
Notes |
132 |
Palindrome Partitioning II |
![](src/yet.png) |
![](src/yet.png) |
Notes |
133 |
Clone Graph |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
134 |
Gas Station |
![](src/yet.png) |
![](src/yet.png) |
Notes |
135 |
Candy |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
136 |
Single Number |
![](src/yet.png) |
![](src/yet.png) |
Notes |
137 |
Single Number II |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
138 |
Copy List with Random Pointer |
![](src/done.png) |
![](src/yet.png) |
Notes |
139 |
Word Break |
![](src/yet.png) |
![](src/yet.png) |
Notes |
140 |
Word Break II |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
141 |
Linked List Cycle |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
142 |
Linked List Cycle II |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
143 |
Reorder List |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
144 |
Binary Tree Preorder Traversal |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
145 |
Binary Tree Postorder Traversal |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
146 |
LRU Cache |
![](src/yet.png) |
![](src/yet.png) |
Notes |
147 |
Insertion Sort List |
![](src/done.png) |
![](src/done.png) |
Notes |
148 |
Sort List |
![](src/done.png) |
![](src/done.png) |
Notes |
149 |
Max Points on a Line |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
150 |
Evaluate Reverse Polish Notation |
![](src/done.png) |
![](src/done.png) |
Notes |
151 |
Reverse Words in a String |
![](src/done.png) |
![](src/done.png) |
Notes |
152 |
Maximum Product Subarray |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
153 |
Find Minimum in Rotated Sorted Array |
![](src/done.png) |
![](src/yet.png) |
Notes |
154 |
Find Minimum in Rotated Sorted Array II |
![](src/done.png) |
![](src/yet.png) |
Notes |
155 |
Min Stack |
![](src/done.png) |
![](src/yet.png) |
Notes |
156 |
Binary Tree Upside Down |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
157 |
Read N Characters Given Read4 |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
158 |
Read N Characters Given Read4 II-Call mult... |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
159 |
Longest Substring with At Most Two Distinc... |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
160 |
Intersection of Two Linked Lists |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
161 |
One Edit Distance |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
162 |
Find Peak Element |
![](src/done.png) |
![](src/done.png) |
Coming soon |
163 |
Missing Ranges |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
164 |
Maximum Gap |
![](src/done.png) |
![](src/yet.png) |
Notes |
165 |
Compare Version Numbers |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
166 |
Fraction to Recurring Decimal |
![](src/done.png) |
![](src/done.png) |
Coming soon |
167 |
Two Sum II-Input array is sorted |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
168 |
Excel Sheet Column Title |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
169 |
Majority Element |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
170 |
Two Sum III-Data structure design |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
171 |
Excel Sheet Column Number |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
172 |
Factorial Trailing Zeroes |
![](src/done.png) |
![](src/done.png) |
Notes |
173 |
Binary Search Tree Iterator |
![](src/done.png) |
![](src/yet.png) |
Notes |
174 |
Dungeon Game |
![](src/yet.png) |
![](src/done.png) |
Notes |
175 |
Combine Two Tables |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
176 |
Second Highest Salary |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
177 |
Nth Highest Salary |
![](src/yet.png) |
![](src/yet.png) |
Notes |
178 |
Rank Scores |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
179 |
Largest Number |
![](src/done.png) |
![](src/done.png) |
Notes |
180 |
Consecutive Numbers |
![](src/yet.png) |
![](src/yet.png) |
Notes |
181 |
Employees Earning More Than Their Managers |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
182 |
Duplicate Emails |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
183 |
Customers Who Never Order |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
184 |
Department Highest Salary |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
186 |
Reverse Words in a String II |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
187 |
Repeated DNA Sequences |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
188 |
Best Time to Buy and Sell Stock IV |
![](src/yet.png) |
![](src/yet.png) |
Notes |
189 |
Rotate Array |
![](src/done.png) |
![](src/yet.png) |
Notes |
190 |
Reverse Bits |
![](src/yet.png) |
![](src/yet.png) |
Notes |
191 |
Number of 1 Bits |
![](src/done.png) |
![](src/yet.png) |
Notes |
192 |
Word Frequency |
![](src/yet.png) |
![](src/yet.png) |
Notes |
193 |
Valid Phone Numbers |
![](src/yet.png) |
![](src/yet.png) |
Notes |
194 |
Transpose File |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
195 |
Tenth Line |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
196 |
Delete Duplicate Emails |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
197 |
Rising Temperature |
![](src/yet.png) |
![](src/yet.png) |
Notes |
198 |
House Robber |
![](src/done.png) |
![](src/yet.png) |
Notes |
199 |
Binary Tree Right Side View |
![](src/yet.png) |
![](src/yet.png) |
Notes |
200 |
Number of Islands |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
201 |
Bitwise AND of Numbers Range |
![](src/yet.png) |
![](src/yet.png) |
Notes |
202 |
Happy Number |
![](src/done.png) |
![](src/done.png) |
Notes |
203 |
Remove Linked List Elements |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
204 |
Count Primes |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
205 |
Isomorphic Strings |
![](src/yet.png) |
![](src/yet.png) |
Notes |
206 |
Reverse Linked List |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
207 |
Course Schedule |
![](src/yet.png) |
![](src/yet.png) |
Notes |
208 |
Implement Trie (Prefix Tree) |
![](src/yet.png) |
![](src/yet.png) |
Notes |
209 |
Minimum Size Subarray Sum |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
210 |
Course Schedule II |
![](src/yet.png) |
![](src/yet.png) |
Notes |
211 |
Add and Search Word-Data structure design |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
212 |
Word Search II |
![](src/yet.png) |
![](src/done.png) |
Notes |
213 |
House Robber II |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
214 |
Shortest Palindrome |
![](src/done.png) |
![](src/yet.png) |
Notes |
215 |
Kth Largest Element in an Array |
![](src/yet.png) |
![](src/done.png) |
Notes |
216 |
Combination Sum III |
![](src/yet.png) |
![](src/yet.png) |
Notes |
217 |
Contains Duplicate |
![](src/yet.png) |
![](src/yet.png) |
Notes |
218 |
The Skyline Problem |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
219 |
Contains Duplicate II |
![](src/yet.png) |
![](src/yet.png) |
Notes |
220 |
Contains Duplicate III |
![](src/yet.png) |
![](src/yet.png) |
Notes |
221 |
Maximal Square |
![](src/yet.png) |
![](src/yet.png) |
Notes |
222 |
Count Complete Tree Nodes |
![](src/yet.png) |
![](src/yet.png) |
Notes |
223 |
Rectangle Area |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
224 |
Basic Calculator |
![](src/yet.png) |
![](src/done.png) |
Notes |
225 |
Implement Stack using Queues |
![](src/yet.png) |
![](src/yet.png) |
Notes |
226 |
Invert Binary Tree |
![](src/done.png) |
![](src/yet.png) |
Notes |
227 |
Basic Calculator II |
![](src/done.png) |
![](src/done.png) |
Notes |
228 |
Summary Ranges |
![](src/yet.png) |
![](src/yet.png) |
Notes |
229 |
Majority Element II |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
230 |
Kth Smallest Element in a BST |
![](src/yet.png) |
![](src/yet.png) |
Notes |
231 |
Power of Two |
![](src/yet.png) |
![](src/yet.png) |
Notes |
232 |
Implement Queue using Stacks |
![](src/yet.png) |
![](src/yet.png) |
Notes |
233 |
Number of Digit One |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
234 |
Palindrome Linked List |
![](src/yet.png) |
![](src/yet.png) |
Notes |
235 |
Lowest Common Ancestor of a Binary Search ... |
![](src/yet.png) |
![](src/yet.png) |
Notes |
236 |
Lowest Common Ancestor of a Binary Tree |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
237 |
Delete Node in a Linked List |
![](src/yet.png) |
![](src/yet.png) |
Notes |
238 |
Product of Array Except Self |
![](src/yet.png) |
![](src/yet.png) |
Notes |
239 |
Sliding Window Maximum |
![](src/yet.png) |
![](src/yet.png) |
Notes |
240 |
Search a 2D Matrix II |
![](src/done.png) |
![](src/done.png) |
Notes |
241 |
Different Ways to Add Parentheses |
![](src/yet.png) |
![](src/done.png) |
Notes |
242 |
Valid Anagram |
![](src/done.png) |
![](src/yet.png) |
Notes |
243 |
Shortest Word Distance |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
244 |
Shortest Word Distance II |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
245 |
Shortest Word Distance III |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
246 |
Strobogrammatic Number |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
247 |
Strobogrammatic Number II |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
248 |
Strobogrammatic Number III |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
249 |
Group Shifted Strings |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
250 |
Count Univalue Subtrees |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
251 |
Flatten 2D Vector |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
252 |
Meeting Rooms |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
253 |
Meeting Rooms II |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
254 |
Factor Combinations |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
255 |
Verify Preorder Sequence in Binary Search ... |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
256 |
Paint House |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
257 |
Binary Tree Paths |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
258 |
Add Digits |
![](src/done.png) |
![](src/yet.png) |
Notes |
259 |
3Sum Smaller |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
260 |
Single Number III |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
261 |
Graph Valid Tree |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
263 |
Ugly Number |
![](src/done.png) |
![](src/done.png) |
Notes |
264 |
Ugly Number II |
![](src/done.png) |
![](src/done.png) |
Notes |
265 |
Paint House II |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
266 |
Palindrome Permutation |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
267 |
Palindrome Permutation II |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
268 |
Missing Number |
![](src/yet.png) |
![](src/yet.png) |
Notes |
269 |
Alien Dictionary |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
270 |
Closest Binary Search Tree Value |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
271 |
Encode and Decode Strings |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
272 |
Closest Binary Search Tree Value II |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
273 |
Integer to English Words |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
274 |
H-Index |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
275 |
H-Index II |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
276 |
Paint Fence |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
277 |
Find the Celebrity |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
278 |
First Bad Version |
![](src/done.png) |
![](src/yet.png) |
Notes |
279 |
Perfect Squares |
![](src/yet.png) |
![](src/yet.png) |
Notes |
280 |
Wiggle Sort |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
281 |
Zigzag Iterator |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
282 |
Expression Add Operators |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
283 |
Move Zeroes |
![](src/yet.png) |
![](src/yet.png) |
Notes |
284 |
Peeking Iterator |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
285 |
Inorder Successor in BST |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
286 |
Walls and Gates |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
287 |
Find the Duplicate Number |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
288 |
Unique Word Abbreviation |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
289 |
Game of Life |
![](src/yet.png) |
![](src/yet.png) |
Notes |
290 |
Word Pattern |
![](src/yet.png) |
![](src/yet.png) |
Notes |
291 |
Word Pattern II |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
292 |
Nim Game |
![](src/yet.png) |
![](src/yet.png) |
Notes |
293 |
Flip Game |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
294 |
Flip Game II |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
295 |
Find Median from Data Stream |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
296 |
Best Meeting Point |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
297 |
Serialize and Deserialize Binary Tree |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
298 |
Binary Tree Longest Consecutive Sequence |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
299 |
Bulls and Cows |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
300 |
Longest Increasing Subsequence |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
301 |
Remove Invalid Parentheses |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
302 |
Smallest Rectangle Enclosing Black Pixels |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
303 |
Range Sum Query-Immutable |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
304 |
Range Sum Query 2D-Immutable |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
305 |
Number of Islands II |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
306 |
Additive Number |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
307 |
Range Sum Query-Mutable |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
308 |
Range Sum Query 2D-Mutable |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
309 |
Best Time to Buy and Sell Stock with Cooldown |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
310 |
Minimum Height Trees |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
311 |
Sparse Matrix Multiplication |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
312 |
Burst Balloons |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
313 |
Super Ugly Number |
![](src/done.png) |
![](src/done.png) |
Notes |
314 |
Binary Tree Vertical Order Traversal |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
315 |
Count of Smaller Numbers After Self |
![](src/done.png) |
![](src/done.png) |
Notes |
316 |
Remove Duplicate Letters |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
317 |
Shortest Distance from All Buildings |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
318 |
Maximum Product of Word Lengths |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
319 |
Bulb Switcher |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
320 |
Generalized Abbreviation |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
321 |
Create Maximum Number |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
322 |
Coin Change |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
323 |
Number of Connected Components in an Undir... |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
324 |
Wiggle Sort II |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
325 |
Maximum Size Subarray Sum Equals k |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
326 |
Power of Three |
![](src/done.png) |
![](src/yet.png) |
Notes |
327 |
Count of Range Sum |
![](src/yet.png) |
![](src/done.png) |
Notes |
328 |
Odd Even Linked List |
![](src/done.png) |
![](src/done.png) |
Notes |
329 |
Longest Increasing Path in a Matrix |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
330 |
Patching Array |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
331 |
Verify Preorder Serialization of a Binary ... |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
332 |
Reconstruct Itinerary |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
333 |
Largest BST Subtree |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
334 |
Increasing Triplet Subsequence |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
335 |
Self Crossing |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
336 |
Palindrome Pairs |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
337 |
House Robber III |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
338 |
Counting Bits |
![](src/done.png) |
![](src/done.png) |
Notes |
339 |
Nested List Weight Sum |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
340 |
Longest Substring with At Most K Distinct ... |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
341 |
Flatten Nested List Iterator |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
342 |
Power of Four |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
343 |
Integer Break |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
344 |
Reverse String |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
345 |
Reverse Vowels of a String |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
346 |
Moving Average from Data Stream |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
347 |
Top K Frequent Elements |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
348 |
Design Tic-Tac-Toe |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
349 |
Intersection of Two Arrays |
![](src/done.png) |
![](src/done.png) |
Notes |
350 |
Intersection of Two Arrays II |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
351 |
Android Unlock Patterns |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
352 |
Data Stream as Disjoint Intervals |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
353 |
Design Snake Game |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
354 |
Russian Doll Envelopes |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
355 |
Design Twitter |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
356 |
Line Reflection |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
357 |
Count Numbers with Unique Digits |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
358 |
Rearrange String k Distance Apart |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
359 |
Logger Rate Limiter |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
360 |
Sort Transformed Array |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
361 |
Bomb Enemy |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
362 |
Design Hit Counter |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
363 |
Max Sum of Rectangle No Larger Than K |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
364 |
Nested List Weight Sum II |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
365 |
Water and Jug Problem |
![](src/done.png) |
![](src/yet.png) |
Notes |
366 |
Find Leaves of Binary Tree |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
367 |
Valid Perfect Square |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
368 |
Largest Divisible Subset |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
369 |
Plus One Linked List |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
370 |
Range Addition |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
371 |
Sum of Two Integers |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
372 |
Super Pow |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
373 |
Find K Pairs with Smallest Sums |
![](src/done.png) |
![](src/done.png) |
Notes |
374 |
Guess Number Higher or Lower |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
375 |
Guess Number Higher or Lower II |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
376 |
Wiggle Subsequence |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
377 |
Combination Sum IV |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
378 |
Kth Smallest Element in a Sorted Matrix |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
379 |
Design Phone Directory |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
380 |
Insert Delete GetRandom O(1) |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
381 |
Insert Delete GetRandom O(1)-Duplicates al... |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
382 |
Linked List Random Node |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
383 |
Ransom Note |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
384 |
Shuffle an Array |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
385 |
Mini Parser |
![](src/done.png) |
![](src/done.png) |
Notes |
386 |
Lexicographical Numbers |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
387 |
First Unique Character in a String |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
388 |
Longest Absolute File Path |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
389 |
Find the Difference |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
390 |
Elimination Game |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
391 |
Perfect Rectangle |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
392 |
Is Subsequence |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
393 |
UTF-8 Validation |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
394 |
Decode String |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
395 |
Longest Substring with At Least K Repeatin... |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
396 |
Rotate Function |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
397 |
Integer Replacement |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
398 |
Random Pick Index |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
399 |
Evaluate Division |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
400 |
Nth Digit |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
401 |
Binary Watch |
![](src/done.png) |
![](src/done.png) |
Notes |
402 |
Remove K Digits |
![](src/done.png) |
![](src/done.png) |
Notes |
403 |
Frog Jump |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
404 |
Sum of Left Leaves |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
405 |
Convert a Number to Hexadecimal |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
406 |
Queue Reconstruction by Height |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
407 |
Trapping Rain Water II |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
408 |
Valid Word Abbreviation |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
409 |
Longest Palindrome |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
410 |
Split Array Largest Sum |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
411 |
Minimum Unique Word Abbreviation |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
412 |
Fizz Buzz |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
413 |
Arithmetic Slices |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
414 |
Third Maximum Number |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
415 |
Add Strings |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
416 |
Partition Equal Subset Sum |
![](src/done.png) |
![](src/done.png) |
Notes |
417 |
Pacific Atlantic Water Flow |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
418 |
Sentence Screen Fitting |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
419 |
Battleships in a Board |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
420 |
Strong Password Checker |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
421 |
Maximum XOR of Two Numbers in an Array |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
422 |
Valid Word Square |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
423 |
Reconstruct Original Digits from English |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
424 |
Longest Repeating Character Replacement |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
425 |
Word Squares |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
432 |
[All Oone Data Structure](problems/432.All_O one_Data_Structure) |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
434 |
Number of Segments in a String |
![](src/done.png) |
![](src/done.png) |
Notes |
435 |
Non-overlapping Intervals |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
436 |
Find Right Interval |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
437 |
Path Sum III |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
438 |
Find All Anagrams in a String |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
439 |
Ternary Expression Parser |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
440 |
K-th Smallest in Lexicographical Order |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
441 |
Arranging Coins |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
442 |
Find All Duplicates in an Array |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
444 |
Sequence Reconstruction |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
445 |
Add Two Numbers II |
![](src/done.png) |
![](src/done.png) |
Notes |
446 |
Arithmetic Slices II-Subsequence |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
447 |
Number of Boomerangs |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
448 |
Find All Numbers Disappeared in an Array |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
449 |
Serialize and Deserialize BST |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
450 |
Delete Node in a BST |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
451 |
Sort Characters By Frequency |
![](src/done.png) |
![](src/done.png) |
Notes |
452 |
Minimum Number of Arrows to Burst Balloons |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
453 |
Minimum Moves to Equal Array Elements |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
454 |
4Sum II |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
455 |
Assign Cookies |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
456 |
132 Pattern |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
459 |
Repeated Substring Pattern |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
460 |
LFU Cache |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
461 |
Hamming Distance |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
462 |
Minimum Moves to Equal Array Elements II |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
463 |
Island Perimeter |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
464 |
Can I Win |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
465 |
Optimal Account Balancing |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
466 |
Count The Repetitions |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
467 |
Unique Substrings in Wraparound String |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
468 |
Validate IP Address |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
469 |
Convex Polygon |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
471 |
Encode String with Shortest Length |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
472 |
Concatenated Words |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
473 |
Matchsticks to Square |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
474 |
Ones and Zeroes |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
475 |
heaters |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
476 |
Number Complement |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
477 |
Total Hamming Distance |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
480 |
Sliding Window Median |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
481 |
Magical String |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
482 |
License Key Formatting |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
483 |
Smallest Good Base |
![](src/done.png) |
![](src/done.png) |
Notes |
484 |
Find Permutation |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
485 |
Max Consecutive Ones |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
486 |
Predict the Winner |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
487 |
Max Consecutive Ones II |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
488 |
Zuma Game |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
490 |
The Maze |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
491 |
Increasing Subsequences |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
492 |
Construct the Rectangle |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
493 |
Reverse Pairs |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
494 |
Target Sum |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
495 |
Teemo Attacking |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
496 |
Next Greater Element I |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
498 |
Diagonal Traverse |
![](src/done.png) |
![](src/done.png) |
Notes |
499 |
The Maze III |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
500 |
Keyboard Row |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
501 |
Find Mode in Binary Search Tree |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
502 |
IPO |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
503 |
Next Greater Element II |
![](src/done.png) |
![](src/done.png) |
Notes |
504 |
Base 7 |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
505 |
The Maze II |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
506 |
Relative Ranks |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
507 |
Perfect Number |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
508 |
Most Frequent Subtree Sum |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
513 |
Find Bottom Left Tree Value |
![](src/done.png) |
![](src/done.png) |
Notes |
514 |
Freedom Trail |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
515 |
Find Largest Value in Each Tree Row |
![](src/done.png) |
![](src/yet.png) |
Notes |
516 |
Longest Palindromic Subsequence |
![](src/done.png) |
![](src/done.png) |
Notes |
517 |
Super Washing Machines |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
520 |
Detect Capital |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
521 |
Longest Uncommon Subsequence I |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
522 |
Longest Uncommon Subsequence II |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
523 |
Continuous Subarray Sum |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
524 |
Longest Word in Dictionary through Deleting |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
525 |
Contiguous Array |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
526 |
Beautiful Arrangement |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
527 |
Word Abbreviation |
![](src/yet.png) |
![](src/yet.png) |
Notes |
529 |
Minesweeper |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
530 |
Minimum Absolute Difference in BST |
![](src/done.png) |
![](src/done.png) |
Notes |
531 |
Lonely Pixel I |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
532 |
K-diff Pairs in an Array |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
533 |
Lonely Pixel II |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
535 |
Encode and Decode TinyURL |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
536 |
Construct Binary Tree from String |
![](src/yet.png) |
![](src/yet.png) |
Notes |
537 |
Complex Number Multiplication |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
538 |
Convert BST to Greater Tree |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
539 |
Minimum Time Difference |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
541 |
Reverse String II |
![](src/done.png) |
![](src/done.png) |
Notes |
542 |
01 Matrix |
![](src/done.png) |
![](src/done.png) |
Notes |
543 |
Diameter of Binary Tree |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
544 |
Output Contest Matches |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
545 |
Boundary of Binary Tree |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
546 |
Remove Boxes |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
547 |
Friend Circles |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
548 |
Split Array with Equal Sum |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
549 |
Binary Tree Longest Consecutive Sequence II |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
551 |
Student Attendance Record I |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
552 |
Student Attendance Record II |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
553 |
Optimal Division |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
554 |
Brick Wall |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
555 |
Split Assembled Strings |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
555 |
Split Concatenated Strings |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
556 |
Next Greater Element III |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
557 |
Reverse Words in a String III |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
560 |
Subarray Sum Equals K |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
561 |
Array Partition I |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
562 |
Longest Line of Consecutive One in Matrix |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
563 |
Binary Tree Tilt |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
564 |
Find the Closest Palindrome |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
565 |
Array Nesting |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
566 |
Reshape the Matrix |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
567 |
Permutation in String |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
568 |
Maximum Vacation Days |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
575 |
Distribute Candies |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
576 |
Out of Boundary Paths |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
581 |
Shortest Unsorted Continuous Subarray |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
582 |
Kill Process |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
583 |
Delete Operation for Two Strings |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
587 |
Erect the Fence |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
591 |
Tag Validator |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
592 |
Fraction Addition and Subtraction |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
593 |
Valid Square |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
594 |
Longest Harmonious Subsequence |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
598 |
Range Addition II |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
599 |
Minimum Index Sum of Two Lists |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
600 |
Non-negative Integers without Consecutive ... |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
604 |
Design Compressed String Iterator |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
605 |
Can Place Flowers |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
606 |
Construct String from Binary Tree |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
609 |
Find Duplicate File in System |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
611 |
Valid Triangle Number |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
616 |
Add Bold Tag in String |
![](src/yet.png) |
![](src/yet.png) |
Coming soon |
617 |
Merge Two Binary Trees |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
621 |
Task Scheduler |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
623 |
Add One Row to Tree |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
624 |
Maximum Distance in Arrays |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
625 |
Minimum Factorization |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
628 |
Maximum Product of Three Numbers |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
629 |
K Inverse Pairs Array |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
630 |
Course Schedule III |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
631 |
Design Excel Sum Formula |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
632 |
Smallest Range |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
633 |
Sum of Square Numbers |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
634 |
Find the Derangement of An Array |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
635 |
Design Log Storage System |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
637 |
Average of Levels in Binary Tree |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
640 |
Solve the Equation |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
647 |
Palindromic Substrings |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
648 |
Replace Words |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
650 |
2 Keys Keyboard |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
652 |
Find Duplicate Subtrees |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
653 |
Two Sum IV-Input is a BST |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
654 |
Maximum Binary Tree |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
655 |
Print Binary Tree |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
656 |
Coin Path |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
657 |
Judge Route Circle |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
658 |
Find K Closest Elements |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
659 |
Split Array into Consecutive Subsequences |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
660 |
Remove 9 |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
661 |
Image Smoother |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
662 |
Maximum Width of Binary Tree |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
663 |
Equal Tree Partition |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
664 |
Strange Printer |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
665 |
Non-decreasing Array |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
666 |
Path Sum IV |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
667 |
Beautiful Arrangement II |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
668 |
Kth Smallest Number in Multiplication Table |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
669 |
Trim a Binary Search Tree |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
670 |
Maximum Swap |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
671 |
Second Minimum Node In a Binary Tree |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
672 |
Bulb Switcher II |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
677 |
Map Sum Pairs |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
678 |
Valid Parenthesis String |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
679 |
24 Game |
![](src/done.png) |
![](src/yet.png) |
Coming soon |
680 |
Valid Palindrome II |
![](src/done.png) |
![](src/yet.png) |
Coming soon |