-
Notifications
You must be signed in to change notification settings - Fork 0
/
B75
473 lines (397 loc) · 5.16 KB
/
B75
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
128. Longest Consecutive Sequence
Med.
Array
Hash Table
Union Find
1. Two Sum
Easy
Array
Hash Table
3. Longest Substring Without Repeating Characters
Med.
Hash Table
String
Sliding Window
5. Longest Palindromic Substring
Med.
Two Pointers
String
Dynamic Programming
133. Clone Graph
Med.
Hash Table
Depth-First Search
Breadth-First Search
Graph
261. Graph Valid Tree
Med.
Depth-First Search
Breadth-First Search
Union Find
Graph
647. Palindromic Substrings
Med.
Two Pointers
String
Dynamic Programming
11. Container With Most Water
Med.
Array
Two Pointers
Greedy
139. Word Break
Med.
Array
Hash Table
String
Dynamic Programming
2+
141. Linked List Cycle
Easy
Hash Table
Linked List
Two Pointers
268. Missing Number
Easy
Array
Hash Table
Math
Binary Search
2+
15. 3Sum
Med.
Array
Two Pointers
Sorting
143. Reorder List
Med.
Linked List
Two Pointers
Stack
Recursion
269. Alien Dictionary
Hard
Array
String
Depth-First Search
Breadth-First Search
2+
271. Encode and Decode Strings
Med.
Array
String
Design
19. Remove Nth Node From End of List
Med.
Linked List
Two Pointers
20. Valid Parentheses
Easy
String
Stack
21. Merge Two Sorted Lists
Easy
Linked List
Recursion
23. Merge k Sorted Lists
Hard
Linked List
Divide and Conquer
Heap (Priority Queue)
Merge Sort
152. Maximum Product Subarray
Med.
Array
Dynamic Programming
153. Find Minimum in Rotated Sorted Array
Med.
Array
Binary Search
33. Search in Rotated Sorted Array
Med.
Array
Binary Search
417. Pacific Atlantic Water Flow
Med.
Array
Depth-First Search
Breadth-First Search
Matrix
39. Combination Sum
Med.
Array
Backtracking
295. Find Median from Data Stream
Hard
Two Pointers
Design
Sorting
Heap (Priority Queue)
1+
424. Longest Repeating Character Replacement
Med.
Hash Table
String
Sliding Window
300. Longest Increasing Subsequence
Med.
Array
Binary Search
Dynamic Programming
48. Rotate Image
Med.
Array
Math
Matrix
49. Group Anagrams
Med.
Array
Hash Table
String
Sorting
435. Non-overlapping Intervals
Med.
Array
Dynamic Programming
Greedy
Sorting
53. Maximum Subarray
Med.
Array
Divide and Conquer
Dynamic Programming
54. Spiral Matrix
Med.
Array
Matrix
Simulation
55. Jump Game
Med.
Array
Dynamic Programming
Greedy
56. Merge Intervals
Med.
Array
Sorting
57. Insert Interval
Med.
Array
572. Subtree of Another Tree
Easy
Tree
Depth-First Search
String Matching
Binary Tree
1+
62. Unique Paths
Med.
Math
Dynamic Programming
Combinatorics
190. Reverse Bits
Easy
Divide and Conquer
Bit Manipulation
191. Number of 1 Bits
Easy
Divide and Conquer
Bit Manipulation
449. Serialize and Deserialize BST
Med.
String
Tree
Depth-First Search
Breadth-First Search
3+
322. Coin Change
Med.
Array
Dynamic Programming
Breadth-First Search
323. Number of Connected Components in an Undirected Graph
Med.
Depth-First Search
Breadth-First Search
Union Find
Graph
70. Climbing Stairs
Easy
Math
Dynamic Programming
Memoization
198. House Robber
Med.
Array
Dynamic Programming
200. Number of Islands
Med.
Array
Depth-First Search
Breadth-First Search
Union Find
1+
73. Set Matrix Zeroes
Med.
Array
Hash Table
Matrix
76. Minimum Window Substring
Hard
Hash Table
String
Sliding Window
206. Reverse Linked List
Easy
Linked List
Recursion
79. Word Search
Med.
Array
String
Backtracking
Matrix
207. Course Schedule
Med.
Depth-First Search
Breadth-First Search
Graph
Topological Sort
208. Implement Trie (Prefix Tree)
Med.
Hash Table
String
Design
Trie
338. Counting Bits
Easy
Dynamic Programming
Bit Manipulation
211. Design Add and Search Words Data Structure
Med.
String
Depth-First Search
Design
Trie
212. Word Search II
Hard
Array
String
Backtracking
Trie
1+
213. House Robber II
Med.
Array
Dynamic Programming
217. Contains Duplicate
Easy
Array
Hash Table
Sorting
91. Decode Ways
Med.
String
Dynamic Programming
347. Top K Frequent Elements
Med.
Array
Hash Table
Divide and Conquer
Sorting
4+
253. Meeting Rooms II
Med.
Array
Two Pointers
Greedy
Sorting
2+
98. Validate Binary Search Tree
Med.
Tree
Depth-First Search
Binary Search Tree
Binary Tree
226. Invert Binary Tree
Easy
Tree
Depth-First Search
Breadth-First Search
Binary Tree
100. Same Tree
Easy
Tree
Depth-First Search
Breadth-First Search
Binary Tree
1143. Longest Common Subsequence
Med.
String
Dynamic Programming
102. Binary Tree Level Order Traversal
Med.
Tree
Breadth-First Search
Binary Tree
230. Kth Smallest Element in a BST
Med.
Tree
Depth-First Search
Binary Search Tree
Binary Tree
104. Maximum Depth of Binary Tree
Easy
Tree
Depth-First Search
Breadth-First Search
Binary Tree
105. Construct Binary Tree from Preorder and Inorder Traversal
Med.
Array
Hash Table
Divide and Conquer
Tree
1+
235. Lowest Common Ancestor of a Binary Search Tree
Med.
Tree
Depth-First Search
Binary Search Tree
Binary Tree
236. Lowest Common Ancestor of a Binary Tree
Med.
Tree
Depth-First Search
Binary Tree
238. Product of Array Except Self
Med.
Array
Prefix Sum
242. Valid Anagram
Easy
Hash Table
String
Sorting
371. Sum of Two Integers
Med.
Math
Bit Manipulation
252. Meeting Rooms
Easy
Array
Sorting
121. Best Time to Buy and Sell Stock
Easy
Array
Dynamic Programming
124. Binary Tree Maximum Path Sum
Hard
Dynamic Programming
Tree
Depth-First Search
Binary Tree
125. Valid Palindrome
Easy
Two Pointers
String