-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlist_g.txt
538 lines (538 loc) · 23.9 KB
/
list_g.txt
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
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
843,ArrayMathStringInteractiveGame Theory,Hard
1423,ArraySliding Window,Medium
1438,ArrayQueueSliding WindowHeap (Priority Queue)Ordered SetMonotonic Queue,Medium
359,Hash TableDesign,Easy
727,StringDynamic ProgrammingSliding Window,Hard
1548,Dynamic ProgrammingGraph,Hard
715,DesignSegment TreeOrdered Set,Hard
690,Hash TableDepth-First SearchBreadth-First Search,Easy
1153,Hash TableString,Hard
1499,ArrayQueueSliding WindowHeap (Priority Queue)Monotonic Queue,Hard
833,ArrayStringSorting,Medium
1610,ArrayMathGeometrySliding WindowSorting,Hard
471,StringDynamic Programming,Hard
946,ArrayStackSimulation,Medium
1110,TreeDepth-First SearchBinary Tree,Medium
853,ArraySorting,Medium
465,ArrayBacktracking,Hard
1509,ArrayGreedySorting,Medium
1293,ArrayBreadth-First SearchMatrix,Hard
552,Dynamic Programming,Hard
809,ArrayTwo PointersString,Medium
1277,ArrayDynamic ProgrammingMatrix,Medium
489,BacktrackingInteractive,Hard
1088,MathBacktracking,Hard
1048,ArrayHash TableTwo PointersStringDynamic Programming,Medium
562,ArrayDynamic ProgrammingMatrix,Medium
900,ArrayDesignCountingIterator,Medium
1406,ArrayMathDynamic ProgrammingGame Theory,Hard
1776,ArrayMathStackHeap (Priority Queue)Monotonic Stack,Hard
1146,ArrayHash TableBinary SearchDesign,Medium
418,StringDynamic Programming,Medium
1477,ArrayHash TableBinary SearchDynamic ProgrammingSliding Window,Medium
1060,ArrayBinary Search,Medium
329,Dynamic ProgrammingDepth-First SearchBreadth-First SearchGraphTopological SortMemoization,Hard
652,TreeDepth-First SearchBreadth-First SearchBinary Tree,Medium
846,ArrayHash TableGreedySorting,Medium
1526,ArrayDynamic ProgrammingStackGreedyMonotonic Stack,Hard
444,ArrayGraphTopological Sort,Medium
951,TreeDepth-First SearchBinary Tree,Medium
995,ArrayBit ManipulationSliding WindowPrefix Sum,Hard
308,ArrayDesignBinary Indexed TreeSegment TreeMatrix,Hard
1254,ArrayDepth-First SearchBreadth-First SearchUnion FindMatrix,Medium
528,MathBinary SearchPrefix SumRandomized,Medium
722,ArrayString,Medium
1631,ArrayBinary SearchDepth-First SearchBreadth-First SearchUnion FindHeap (Priority Queue)Matrix,Medium
1444,ArrayDynamic ProgrammingMemoizationMatrix,Hard
299,Hash TableStringCounting,Medium
1376,TreeDepth-First SearchBreadth-First Search,Medium
1138,Hash TableString,Medium
1368,ArrayBreadth-First SearchGraphHeap (Priority Queue)MatrixShortest Path,Hard
1525,StringDynamic ProgrammingBit Manipulation,Medium
963,ArrayMathGeometry,Medium
68,StringSimulation,Hard
777,Two PointersString,Medium
85,ArrayDynamic ProgrammingStackMatrixMonotonic Stack,Hard
753,Depth-First SearchGraphEulerian Circuit,Hard
770,Hash TableMathStringStackRecursion,Hard
1240,Dynamic ProgrammingBacktracking,Hard
1504,ArrayDynamic ProgrammingStackMatrixMonotonic Stack,Medium
732,DesignSegment TreeOrdered Set,Hard
1,ArrayHash Table,Easy
911,ArrayHash TableBinary SearchDesign,Medium
837,MathDynamic ProgrammingSliding WindowProbability and Statistics,Medium
248,ArrayStringRecursion,Hard
394,StringStackRecursion,Medium
847,Dynamic ProgrammingBit ManipulationBreadth-First SearchGraphBitmask,Hard
593,MathGeometry,Medium
1618,ArrayStringBinary SearchInteractive,Medium
1231,ArrayBinary Search,Hard
1377,TreeDepth-First SearchBreadth-First SearchGraph,Hard
913,MathDynamic ProgrammingBreadth-First SearchGraphMemoizationGame Theory,Hard
354,ArrayBinary SearchDynamic ProgrammingSorting,Hard
1136,GraphTopological Sort,Medium
818,Dynamic Programming,Hard
57,Array,Medium
642,StringDesignTrieData Stream,Hard
721,ArrayStringDepth-First SearchBreadth-First SearchUnion Find,Medium
149,Hash TableMathGeometry,Hard
981,Hash TableStringBinary SearchDesign,Medium
351,Dynamic ProgrammingBacktracking,Medium
346,ArrayDesignQueueData Stream,Easy
1219,ArrayBacktrackingMatrix,Medium
460,Hash TableLinked ListDesignDoubly-Linked List,Hard
1296,ArrayHash TableGreedySorting,Medium
695,ArrayDepth-First SearchBreadth-First SearchUnion FindMatrix,Medium
1483,Binary SearchDynamic ProgrammingTreeDepth-First SearchBreadth-First SearchDesign,Hard
776,TreeBinary Search TreeRecursionBinary Tree,Medium
527,ArrayStringGreedyTrieSorting,Hard
304,ArrayDesignMatrixPrefix Sum,Medium
875,ArrayBinary Search,Medium
253,ArrayTwo PointersGreedySortingHeap (Priority Queue),Medium
295,Two PointersDesignSortingHeap (Priority Queue)Data Stream,Hard
284,ArrayDesignIterator,Medium
56,ArraySorting,Medium
420,StringGreedyHeap (Priority Queue),Hard
844,Two PointersStringStackSimulation,Easy
379,ArrayHash TableLinked ListDesignQueue,Medium
417,ArrayDepth-First SearchBreadth-First SearchMatrix,Medium
803,ArrayUnion FindMatrix,Hard
1223,ArrayDynamic Programming,Hard
1057,ArrayGreedySorting,Medium
850,ArraySegment TreeLine SweepOrdered Set,Hard
767,Hash TableStringGreedySortingHeap (Priority Queue)Counting,Medium
315,ArrayBinary SearchDivide and ConquerBinary Indexed TreeSegment TreeMerge SortOrdered Set,Hard
1197,Breadth-First Search,Medium
1706,ArrayDynamic ProgrammingDepth-First SearchMatrixSimulation,Medium
1388,ArrayDynamic ProgrammingGreedyHeap (Priority Queue),Hard
130,ArrayDepth-First SearchBreadth-First SearchUnion FindMatrix,Medium
1345,ArrayHash TableBreadth-First Search,Hard
407,ArrayBreadth-First SearchHeap (Priority Queue)Matrix,Hard
410,ArrayBinary SearchDynamic ProgrammingGreedy,Hard
1244,Hash TableDesignSorting,Medium
271,ArrayStringDesign,Medium
907,ArrayDynamic ProgrammingStackMonotonic Stack,Medium
834,Dynamic ProgrammingTreeDepth-First SearchGraph,Hard
659,ArrayHash TableGreedyHeap (Priority Queue),Medium
729,DesignSegment TreeOrdered Set,Medium
406,ArrayGreedySorting,Medium
631,GraphDesignTopological Sort,Hard
165,Two PointersString,Medium
919,TreeBreadth-First SearchDesignBinary Tree,Medium
362,ArrayHash TableBinary SearchDesignQueue,Medium
1592,String,Easy
604,ArrayHash TableStringDesignIterator,Easy
1066,ArrayDynamic ProgrammingBacktrackingBit ManipulationBitmask,Medium
1101,ArrayUnion Find,Medium
200,ArrayDepth-First SearchBreadth-First SearchUnion FindMatrix,Medium
1237,MathTwo PointersBinary SearchInteractive,Medium
1478,ArrayMathDynamic ProgrammingSorting,Hard
146,Hash TableLinked ListDesignDoubly-Linked List,Medium
428,StringTreeDepth-First SearchBreadth-First Search,Hard
638,ArrayDynamic ProgrammingBacktrackingBit ManipulationMemoizationBitmask,Medium
1074,ArrayHash TableMatrixPrefix Sum,Hard
1825,DesignQueueHeap (Priority Queue)Ordered Set,Hard
939,ArrayHash TableMathGeometrySorting,Medium
222,Binary SearchTreeDepth-First SearchBinary Tree,Medium
849,Array,Medium
224,MathStringStackRecursion,Hard
736,Hash TableStringStackRecursion,Hard
692,Hash TableStringTrieSortingHeap (Priority Queue)Bucket SortCounting,Medium
1140,ArrayMathDynamic ProgrammingGame Theory,Medium
723,ArrayTwo PointersMatrixSimulation,Medium
894,Dynamic ProgrammingTreeRecursionMemoizationBinary Tree,Medium
758,ArrayHash TableStringTrieString Matching,Medium
1091,ArrayBreadth-First SearchMatrix,Medium
2,Linked ListMathRecursion,Medium
688,Dynamic Programming,Medium
855,DesignOrdered Set,Medium
968,Dynamic ProgrammingTreeDepth-First SearchBinary Tree,Hard
549,TreeDepth-First SearchBinary Tree,Medium
375,MathDynamic ProgrammingGame Theory,Medium
792,Hash TableStringTrieSorting,Medium
499,Depth-First SearchBreadth-First SearchGraphHeap (Priority Queue)Shortest Path,Hard
1157,ArrayBinary SearchDesignBinary Indexed TreeSegment Tree,Hard
1363,ArrayDynamic ProgrammingGreedy,Hard
298,TreeDepth-First SearchBinary Tree,Medium
1616,Two PointersStringGreedy,Medium
221,ArrayDynamic ProgrammingMatrix,Medium
365,MathDepth-First SearchBreadth-First Search,Medium
124,Dynamic ProgrammingTreeDepth-First SearchBinary Tree,Hard
157,StringSimulationInteractive,Easy
247,ArrayStringRecursion,Medium
210,Depth-First SearchBreadth-First SearchGraphTopological Sort,Medium
269,ArrayStringDepth-First SearchBreadth-First SearchGraphTopological Sort,Hard
726,Hash TableStringStack,Hard
1087,StringBacktrackingBreadth-First Search,Medium
679,ArrayMathBacktracking,Hard
1782,Two PointersBinary SearchGraph,Hard
212,ArrayStringBacktrackingTrieMatrix,Hard
1032,ArrayStringDesignTrieData Stream,Hard
1027,ArrayHash TableBinary SearchDynamic Programming,Medium
731,DesignSegment TreeOrdered Set,Medium
360,ArrayMathTwo PointersSorting,Medium
53,ArrayDivide and ConquerDynamic Programming,Easy
1411,Dynamic Programming,Hard
353,ArrayDesignQueueMatrix,Medium
1553,Dynamic ProgrammingMemoization,Hard
1697,ArrayUnion FindGraphSorting,Hard
1352,ArrayMathDesignQueueData Stream,Medium
1166,Hash TableStringDesignTrie,Medium
1778,Depth-First SearchBreadth-First SearchGraphInteractive,Medium
211,StringDepth-First SearchDesignTrie,Medium
1102,ArrayDepth-First SearchBreadth-First SearchUnion FindHeap (Priority Queue)Matrix,Medium
949,StringEnumeration,Medium
239,ArrayQueueSliding WindowHeap (Priority Queue)Monotonic Queue,Hard
1187,ArrayBinary SearchDynamic Programming,Hard
504,Math,Easy
31,ArrayTwo Pointers,Medium
174,ArrayDynamic ProgrammingMatrix,Hard
947,Depth-First SearchUnion FindGraph,Medium
44,StringDynamic ProgrammingGreedyRecursion,Hard
246,Hash TableTwo PointersString,Easy
609,ArrayHash TableString,Medium
840,ArrayMathMatrix,Medium
317,ArrayBreadth-First SearchMatrix,Hard
64,ArrayDynamic ProgrammingMatrix,Medium
226,TreeDepth-First SearchBreadth-First SearchBinary Tree,Easy
1055,StringDynamic ProgrammingGreedy,Medium
551,String,Easy
121,ArrayDynamic Programming,Easy
1218,ArrayHash TableDynamic Programming,Medium
150,ArrayMathStack,Medium
397,Dynamic ProgrammingBit ManipulationMemoization,Medium
1326,ArrayDynamic ProgrammingGreedy,Hard
446,ArrayDynamic Programming,Hard
992,ArrayHash TableSliding WindowCounting,Hard
128,ArrayHash TableUnion Find,Medium
480,ArrayHash TableSliding WindowHeap (Priority Queue),Hard
378,ArrayBinary SearchSortingHeap (Priority Queue)Matrix,Medium
337,Dynamic ProgrammingTreeDepth-First SearchBinary Tree,Medium
152,ArrayDynamic Programming,Medium
140,Hash TableStringDynamic ProgrammingBacktrackingTrieMemoization,Hard
1292,ArrayBinary SearchMatrixPrefix Sum,Medium
636,ArrayStack,Medium
296,ArrayMathSortingMatrix,Hard
1514,GraphHeap (Priority Queue)Shortest Path,Medium
198,ArrayDynamic Programming,Medium
403,ArrayDynamic Programming,Hard
741,ArrayDynamic ProgrammingMatrix,Hard
1417,String,Easy
192,Shell,Medium
1314,ArrayMatrixPrefix Sum,Medium
934,ArrayDepth-First SearchBreadth-First SearchMatrix,Medium
1793,ArrayTwo PointersStackMonotonic Stack,Hard
158,StringSimulationInteractive,Hard
752,ArrayHash TableStringBreadth-First Search,Medium
1131,ArrayMath,Medium
276,Dynamic Programming,Medium
72,StringDynamic Programming,Hard
297,StringTreeDepth-First SearchBreadth-First SearchDesignBinary Tree,Hard
76,Hash TableStringSliding Window,Hard
249,ArrayHash TableString,Medium
388,StringStackDepth-First Search,Medium
384,ArrayMathRandomized,Medium
218,ArrayDivide and ConquerBinary Indexed TreeSegment TreeLine SweepHeap (Priority Queue)Ordered Set,Hard
1642,ArrayGreedyHeap (Priority Queue),Medium
1095,ArrayBinary SearchInteractive,Hard
769,ArrayStackGreedySortingMonotonic Stack,Medium
127,Hash TableStringBreadth-First Search,Hard
1255,ArrayStringDynamic ProgrammingBacktrackingBit ManipulationBitmask,Hard
1044,StringBinary SearchSliding WindowRolling HashSuffix ArrayHash Function,Hard
1866,MathDynamic ProgrammingCombinatorics,Hard
493,ArrayBinary SearchDivide and ConquerBinary Indexed TreeSegment TreeMerge SortOrdered Set,Hard
1834,ArraySortingHeap (Priority Queue),Medium
163,Array,Easy
524,ArrayTwo PointersStringSorting,Medium
245,ArrayString,Medium
501,TreeDepth-First SearchBinary Search TreeBinary Tree,Easy
115,StringDynamic Programming,Hard
560,ArrayHash TablePrefix Sum,Medium
347,ArrayHash TableDivide and ConquerSortingHeap (Priority Queue)Bucket SortCountingQuickselect,Medium
1283,ArrayBinary Search,Medium
91,StringDynamic Programming,Medium
621,ArrayHash TableGreedySortingHeap (Priority Queue)Counting,Medium
306,StringBacktracking,Medium
1170,ArrayHash TableStringBinary SearchSorting,Medium
393,ArrayBit Manipulation,Medium
424,Hash TableStringSliding Window,Medium
332,Depth-First SearchGraphEulerian Circuit,Medium
368,ArrayMathDynamic ProgrammingSorting,Medium
241,MathStringDynamic ProgrammingRecursionMemoization,Medium
1870,ArrayBinary Search,Medium
300,ArrayBinary SearchDynamic Programming,Medium
363,ArrayBinary SearchDynamic ProgrammingMatrixOrdered Set,Hard
1007,ArrayGreedy,Medium
529,ArrayDepth-First SearchBreadth-First SearchMatrix,Medium
162,ArrayBinary Search,Medium
334,ArrayGreedy,Medium
1576,String,Easy
17,Hash TableStringBacktracking,Medium
986,ArrayTwo Pointers,Medium
399,ArrayDepth-First SearchBreadth-First SearchUnion FindGraphShortest Path,Medium
4,ArrayBinary SearchDivide and Conquer,Hard
208,Hash TableStringDesignTrie,Medium
396,MathDynamic Programming,Medium
134,ArrayGreedy,Medium
863,TreeDepth-First SearchBreadth-First SearchBinary Tree,Medium
1145,TreeDepth-First SearchBinary Tree,Medium
216,ArrayBacktracking,Medium
327,ArrayBinary SearchDivide and ConquerBinary Indexed TreeSegment TreeMerge SortOrdered Set,Hard
34,ArrayBinary Search,Medium
490,Depth-First SearchBreadth-First SearchGraph,Medium
361,ArrayDynamic ProgrammingMatrix,Medium
1265,Linked ListTwo PointersStackRecursion,Medium
84,ArrayStackMonotonic Stack,Hard
432,Hash TableLinked ListDesignDoubly-Linked List,Hard
15,ArrayTwo PointersSorting,Medium
187,Hash TableStringBit ManipulationSliding WindowRolling HashHash Function,Medium
42,ArrayTwo PointersDynamic ProgrammingStackMonotonic Stack,Hard
312,ArrayDynamic Programming,Hard
173,StackTreeDesignBinary Search TreeBinary TreeIterator,Medium
862,ArrayBinary SearchQueueSliding WindowHeap (Priority Queue)Prefix SumMonotonic Queue,Hard
137,ArrayBit Manipulation,Medium
286,ArrayBreadth-First SearchMatrix,Medium
827,ArrayDepth-First SearchBreadth-First SearchUnion FindMatrix,Hard
698,ArrayDynamic ProgrammingBacktrackingBit ManipulationMemoizationBitmask,Medium
301,StringBacktrackingBreadth-First Search,Hard
10,StringDynamic ProgrammingRecursion,Hard
1031,ArrayDynamic ProgrammingSliding Window,Medium
632,ArrayHash TableGreedySliding WindowSortingHeap (Priority Queue),Hard
139,Hash TableStringDynamic ProgrammingTrieMemoization,Medium
759,ArraySortingHeap (Priority Queue),Hard
415,MathStringSimulation,Easy
559,TreeDepth-First SearchBreadth-First Search,Easy
23,Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort,Hard
279,MathDynamic ProgrammingBreadth-First Search,Medium
435,ArrayDynamic ProgrammingGreedySorting,Medium
686,StringString Matching,Medium
340,Hash TableStringSliding Window,Medium
257,StringTreeDepth-First SearchBinary Tree,Easy
5,StringDynamic Programming,Medium
588,Hash TableStringDesignTrie,Hard
857,ArrayGreedySortingHeap (Priority Queue),Hard
836,MathGeometry,Easy
1229,ArrayTwo PointersSorting,Medium
71,StringStack,Medium
215,ArrayDivide and ConquerSortingHeap (Priority Queue)Quickselect,Medium
830,String,Easy
989,ArrayMath,Easy
318,ArrayStringBit Manipulation,Medium
323,Depth-First SearchBreadth-First SearchUnion FindGraph,Medium
977,ArrayTwo PointersSorting,Easy
395,Hash TableStringDivide and ConquerSliding Window,Medium
706,ArrayHash TableLinked ListDesignHash Function,Easy
132,StringDynamic Programming,Hard
62,MathDynamic ProgrammingCombinatorics,Medium
1135,Union FindGraphHeap (Priority Queue)Minimum Spanning Tree,Medium
969,ArrayTwo PointersGreedySorting,Medium
387,Hash TableStringQueueCounting,Easy
3,Hash TableStringSliding Window,Medium
817,Hash TableLinked List,Medium
343,MathDynamic Programming,Medium
459,StringString Matching,Easy
658,ArrayTwo PointersBinary SearchSortingHeap (Priority Queue),Medium
100,TreeDepth-First SearchBreadth-First SearchBinary Tree,Easy
975,ArrayDynamic ProgrammingStackMonotonic StackOrdered Set,Hard
1882,ArrayHeap (Priority Queue),Medium
38,String,Medium
1658,ArrayHash TableTwo PointersBinary SearchPrefix Sum,Medium
66,ArrayMath,Easy
1162,ArrayDynamic ProgrammingBreadth-First SearchMatrix,Medium
350,ArrayHash TableTwo PointersBinary SearchSorting,Easy
22,StringDynamic ProgrammingBacktracking,Medium
871,ArrayDynamic ProgrammingGreedyHeap (Priority Queue),Hard
889,ArrayHash TableDivide and ConquerTreeBinary Tree,Medium
250,TreeDepth-First SearchBinary Tree,Medium
177,Database,Medium
133,Hash TableDepth-First SearchBreadth-First SearchGraph,Medium
131,StringDynamic ProgrammingBacktracking,Medium
219,ArrayHash TableSliding Window,Easy
994,ArrayBreadth-First SearchMatrix,Medium
20,StringStack,Easy
188,ArrayDynamic Programming,Hard
904,ArrayHash TableSliding Window,Medium
78,ArrayBacktrackingBit Manipulation,Medium
252,ArraySorting,Easy
50,MathRecursion,Medium
214,StringRolling HashString MatchingHash Function,Hard
41,ArrayHash Table,Hard
979,TreeDepth-First SearchBinary Tree,Medium
154,ArrayBinary Search,Hard
788,MathDynamic Programming,Easy
941,Array,Easy
348,ArrayHash TableDesignMatrix,Medium
419,ArrayDepth-First SearchMatrix,Medium
1312,StringDynamic Programming,Hard
63,ArrayDynamic ProgrammingMatrix,Medium
856,StringStack,Medium
647,StringDynamic Programming,Medium
380,ArrayHash TableMathDesignRandomized,Medium
168,MathString,Easy
1049,ArrayDynamic Programming,Medium
1094,ArraySortingHeap (Priority Queue)SimulationPrefix Sum,Medium
535,Hash TableStringDesignHash Function,Medium
1539,ArrayBinary Search,Easy
1026,TreeDepth-First SearchBinary Tree,Medium
179,StringGreedySorting,Medium
242,Hash TableStringSorting,Easy
1209,StringStack,Medium
114,Linked ListStackTreeDepth-First SearchBinary Tree,Medium
739,ArrayStackMonotonic Stack,Medium
443,Two PointersString,Medium
282,MathStringBacktracking,Hard
234,Linked ListTwo PointersStackRecursion,Easy
973,ArrayMathDivide and ConquerGeometrySortingHeap (Priority Queue)Quickselect,Medium
9,Math,Easy
287,ArrayTwo PointersBinary SearchBit Manipulation,Medium
303,ArrayDesignPrefix Sum,Easy
886,Depth-First SearchBreadth-First SearchUnion FindGraph,Medium
374,Binary SearchInteractive,Easy
392,Two PointersStringDynamic Programming,Easy
717,Array,Easy
70,MathDynamic ProgrammingMemoization,Easy
159,Hash TableStringSliding Window,Medium
229,ArrayHash TableSortingCounting,Medium
1329,ArraySortingMatrix,Medium
345,Two PointersString,Easy
101,TreeDepth-First SearchBreadth-First SearchBinary Tree,Easy
37,ArrayBacktrackingMatrix,Hard
1603,DesignSimulationCounting,Easy
398,Hash TableMathReservoir SamplingRandomized,Medium
451,Hash TableStringSortingHeap (Priority Queue)Bucket SortCounting,Medium
518,ArrayDynamic Programming,Medium
682,ArrayStackSimulation,Easy
766,ArrayMatrix,Easy
1155,Dynamic Programming,Medium
328,Linked List,Medium
452,ArrayGreedySorting,Medium
129,TreeDepth-First SearchBinary Tree,Medium
236,TreeDepth-First SearchBinary Tree,Medium
735,ArrayStack,Medium
733,ArrayDepth-First SearchBreadth-First SearchMatrix,Easy
791,Hash TableStringSorting,Medium
227,MathStringStack,Medium
283,ArrayTwo Pointers,Easy
498,ArrayMatrixSimulation,Medium
938,TreeDepth-First SearchBinary Search TreeBinary Tree,Easy
581,ArrayTwo PointersStackGreedySortingMonotonic Stack,Medium
8,String,Medium
1192,Depth-First SearchGraphBiconnected Component,Hard
16,ArrayTwo PointersSorting,Medium
1019,ArrayLinked ListStackMonotonic Stack,Medium
30,Hash TableStringSliding Window,Hard
110,TreeDepth-First SearchBinary Tree,Easy
228,Array,Easy
438,Hash TableStringSliding Window,Medium
814,TreeDepth-First SearchBinary Tree,Medium
310,Depth-First SearchBreadth-First SearchGraphTopological Sort,Medium
148,Linked ListTwo PointersDivide and ConquerSortingMerge Sort,Medium
21,Linked ListRecursion,Easy
671,TreeDepth-First SearchBinary Tree,Easy
326,MathRecursion,Easy
11,ArrayTwo PointersGreedy,Medium
54,ArrayMatrixSimulation,Medium
509,MathDynamic ProgrammingRecursionMemoization,Easy
103,TreeBreadth-First SearchBinary Tree,Medium
108,ArrayDivide and ConquerTreeBinary Search TreeBinary Tree,Easy
14,String,Easy
430,Linked ListDepth-First SearchDoubly-Linked List,Medium
126,Hash TableStringBacktrackingBreadth-First Search,Hard
1041,MathStringSimulation,Medium
622,ArrayLinked ListDesignQueue,Medium
95,Dynamic ProgrammingBacktrackingTreeBinary Search TreeBinary Tree,Medium
1011,ArrayBinary Search,Medium
316,StringStackGreedyMonotonic Stack,Medium
43,MathStringSimulation,Medium
1021,StringStack,Easy
543,TreeDepth-First SearchBinary Tree,Easy
25,Linked ListRecursion,Hard
341,StackTreeDepth-First SearchDesignQueueIterator,Medium
136,ArrayBit Manipulation,Easy
402,StringStackGreedyMonotonic Stack,Medium
209,ArrayBinary SearchSliding WindowPrefix Sum,Medium
718,ArrayBinary SearchDynamic ProgrammingSliding WindowRolling HashHash Function,Medium
1650,Hash TableTreeBinary Tree,Medium
59,ArrayMatrixSimulation,Medium
207,Depth-First SearchBreadth-First SearchGraphTopological Sort,Medium
1588,ArrayPrefix Sum,Easy
905,ArrayTwo PointersSorting,Easy
617,TreeDepth-First SearchBreadth-First SearchBinary Tree,Easy
426,Linked ListStackTreeDepth-First SearchBinary Search TreeBinary TreeDoubly-Linked List,Medium
1143,StringDynamic Programming,Medium
743,Depth-First SearchBreadth-First SearchGraphHeap (Priority Queue)Shortest Path,Medium
7,Math,Easy
69,MathBinary Search,Easy
48,ArrayMathMatrix,Medium
703,TreeDesignBinary Search TreeHeap (Priority Queue)Binary TreeData Stream,Easy
118,ArrayDynamic Programming,Easy
109,Linked ListDivide and ConquerTreeBinary Search TreeBinary Tree,Medium
929,ArrayHash TableString,Easy
116,TreeDepth-First SearchBreadth-First SearchBinary Tree,Medium
273,MathStringRecursion,Hard
169,ArrayHash TableDivide and ConquerSortingCounting,Easy
258,MathSimulationNumber Theory,Easy
701,TreeBinary Search TreeBinary Tree,Medium
13,Hash TableMathString,Easy
289,ArrayMatrixSimulation,Medium
787,Dynamic ProgrammingDepth-First SearchBreadth-First SearchGraphHeap (Priority Queue)Shortest Path,Medium
542,ArrayDynamic ProgrammingBreadth-First SearchMatrix,Medium
680,Two PointersStringGreedy,Easy
12,Hash TableMathString,Medium
322,ArrayDynamic ProgrammingBreadth-First Search,Medium
36,ArrayHash TableMatrix,Medium
120,ArrayDynamic Programming,Medium
204,ArrayMathEnumerationNumber Theory,Easy
567,Hash TableTwo PointersStringSliding Window,Medium
49,Hash TableStringSorting,Medium
503,ArrayStackMonotonic Stack,Medium
45,ArrayDynamic ProgrammingGreedy,Medium
203,Linked ListRecursion,Easy
1313,Array,Easy
51,ArrayBacktracking,Hard
278,Binary SearchInteractive,Easy
937,ArrayStringSorting,Easy
58,String,Easy
81,ArrayBinary Search,Medium
175,Database,Easy
450,TreeBinary Search TreeBinary Tree,Medium
24,Linked ListRecursion,Medium
206,Linked ListRecursion,Easy
79,ArrayBacktrackingMatrix,Medium
96,MathDynamic ProgrammingTreeBinary Search TreeBinary Tree,Medium
106,ArrayHash TableDivide and ConquerTreeBinary Tree,Medium
190,Divide and ConquerBit Manipulation,Easy
123,ArrayDynamic Programming,Hard
33,ArrayBinary Search,Medium
105,ArrayHash TableDivide and ConquerTreeBinary Tree,Medium
98,TreeDepth-First SearchBinary Search TreeBinary Tree,Medium
39,ArrayBacktracking,Medium
494,ArrayDynamic ProgrammingBacktracking,Medium
94,StackTreeDepth-First SearchBinary Tree,Easy
205,Hash TableString,Easy
256,ArrayDynamic Programming,Medium
485,Array,Easy
46,ArrayBacktracking,Medium
547,Depth-First SearchBreadth-First SearchUnion FindGraph,Medium
240,ArrayBinary SearchDivide and ConquerMatrix,Medium
416,ArrayDynamic Programming,Medium
238,ArrayPrefix Sum,Medium
1089,ArrayTwo Pointers,Easy
102,TreeBreadth-First SearchBinary Tree,Medium
412,MathStringSimulation,Easy
26,ArrayTwo Pointers,Easy
1108,String,Easy
230,TreeDepth-First SearchBinary Search TreeBinary Tree,Medium
74,ArrayBinary SearchMatrix,Medium
176,Database,Easy
336,ArrayHash TableStringTrie,Hard
155,StackDesign,Easy
144,StackTreeDepth-First SearchBinary Tree,Easy
189,ArrayMathTwo Pointers,Medium
75,ArrayTwo PointersSorting,Medium
28,Two PointersStringString Matching,Easy
1480,ArrayPrefix Sum,Easy
92,Linked List,Medium
746,ArrayDynamic Programming,Easy
141,Hash TableLinked ListTwo Pointers,Easy
97,StringDynamic Programming,Medium