Repository navigation
Expand file tree
/
Copy pathprogress.yaml
More file actions
3220 lines (3220 loc) · 93 KB
/
Copy pathprogress.yaml
File metadata and controls
3220 lines (3220 loc) · 93 KB
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
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
flashcards:
arrays:
attempts:
- count: 19
date: '2025-12-04T15:24:10.742915'
notes: Perfect score
score: 19
time_seconds: 278
- count: 19
date: '2025-12-03T19:30:41.180459'
notes: 'Missed Q6: .index(x) not .find(x); Q8: bisect.bisect_left(A, x) is a
module; Q13: A.remove(x) one-liner exists; Q17: A.reverse() in-place vs A[::-1]
copy'
score: 15
time_seconds: 385
name: 02-arrays
target_seconds: 570
binary-trees:
attempts:
- count: 21
date: '2025-12-13T09:41:49.529830'
notes: Perfect score
score: 21
time_seconds: 222
- count: 21
date: '2025-12-12T12:47:43.744485'
notes: 'Missed: Q13 (check-is-left-child)'
score: 20
time_seconds: 292
- count: 21
date: '2025-12-05T14:11:52.995107'
notes: 'Missed: check-exactly-one-child'
score: 20
time_seconds: 253
- count: 21
date: '2025-12-05T14:11:26.072208'
notes: 'Missed: check-exactly-one-child, compare-data-equality'
score: 19
time_seconds: 253
- count: 21
date: '2025-12-04T16:16:05.095447'
notes: 'Missed: create-node, check-exactly-one-child'
score: 19
time_seconds: 296
name: 06-binary-trees
target_seconds: 630
bitwise:
attempts:
- count: 17
date: '2025-12-04T15:54:54.517806'
notes: Perfect
score: 17
time_seconds: 457
- count: 17
date: '2025-12-04T15:54:00.147810'
notes: 'Missed: Q16'
score: 16
time_seconds: 457
- count: 17
date: '2025-12-04T15:53:23.433096'
notes: 'Missed: Q8, Q16'
score: 15
time_seconds: 457
- count: 17
date: '2025-12-03T19:17:17.390889'
score: 17
time_seconds: 624
name: 01-bitwise
target_seconds: 510
counter:
attempts:
- count: 11
date: '2025-12-13T09:59:32.379873'
notes: Perfect score
score: 11
time_seconds: 144
- count: 11
date: '2025-12-12T13:14:10.850889'
notes: 'Missed: Q4'
score: 10
time_seconds: 210
- count: 11
date: '2025-12-06T17:56:10.630612'
notes: 'Missed: Q32'
score: 10
time_seconds: 125
name: 09-counter
target_seconds: 330
csv:
attempts:
- count: 23
date: '2025-12-16T11:39:17.766499'
notes: 'Missed: Q1, Q2, Q7, Q12, Q15, Q20, Q22'
score: 17
time_seconds: 731
- count: 23
date: '2025-12-06T18:12:57.602566'
notes: 'Missed: Q1, Q2, Q11, Q12, Q13, Q15, Q20, Q21'
score: 15
time_seconds: 654
name: 13-csv
target_seconds: 690
dicts-basics:
attempts:
- count: 23
date: '2025-12-15T13:45:25.789335'
notes: Perfect score
score: 23
time_seconds: 277
- count: 23
date: '2025-12-14T13:01:00.571300'
notes: 'Missed: Q8'
score: 22
time_seconds: 324
- count: 23
date: '2025-12-13T09:48:47.242074'
notes: 'Missed: Q5, Q17'
score: 21
time_seconds: 300
- count: 23
date: '2025-12-12T12:57:42.176813'
notes: 'Missed: Q6, Q8, Q16, Q17, Q20'
score: 19
time_seconds: 337
- count: 23
date: '2025-12-06T17:45:15.645241'
notes: 'Missed: Q6, Q9, Q14, Q16, Q18, Q20'
score: 17
time_seconds: 292
- count: 23
date: '2025-12-06T17:43:57.094002'
notes: 'Missed: Q6, Q9, Q14, Q16, Q18, Q20'
score: 17
time_seconds: 292
name: 07-dicts-basics
target_seconds: 690
file-io:
attempts:
- count: 13
date: '2025-12-13T12:09:35.669510'
notes: Perfect score
score: 13
time_seconds: 227
- count: 13
date: '2025-12-12T13:42:34.596513'
notes: 'Missed: Q13'
score: 12
time_seconds: 218
- count: 13
date: '2025-12-06T00:00:00.000000'
notes: 'Missed: Q1, Q9, Q12'
score: 10
time_seconds: 234
name: 12-file-io
target_seconds: 390
functools:
attempts:
- count: 7
date: '2025-12-13T12:04:23.450416'
notes: Perfect score
score: 7
time_seconds: 176
- count: 7
date: '2025-12-12T13:33:56.479670'
notes: 'Missed: Q5, Q6'
score: 5
time_seconds: 228
- count: 7
date: '2025-12-05T20:21:16.840284'
notes: Perfect score
score: 7
time_seconds: 151
- count: 6
date: '2025-12-05T21:00:00.000000'
notes: 'Missed: Q3, Q6'
score: 4
time_seconds: 168
name: 11-functools
target_seconds: 180
heaps:
attempts:
- count: 23
date: '2025-12-09T11:28:22.703134'
notes: 'Missed: Q10, Q12'
score: 21
time_seconds: 419
name: 18-heaps
target_seconds: 690
itertools:
attempts: []
name: 20-itertools
target_seconds: 600
linked-lists:
attempts:
- count: 15
date: '2025-12-03T19:57:47.524060'
score: 15
time_seconds: 431
name: 04-linked-lists
target_seconds: 450
ordereddict:
attempts:
- count: 8
date: '2025-12-15T13:51:11.141993'
notes: Perfect score
score: 8
time_seconds: 191
- count: 5
date: '2025-12-14T13:07:31.338386'
notes: 'Missed: Q5'
score: 4
time_seconds: 138
- count: 5
date: '2025-12-13T09:52:27.831320'
notes: 'Missed: Q5'
score: 4
time_seconds: 118
- count: 5
date: '2025-12-12T13:04:10.998099'
notes: 'Missed: Q5'
score: 4
time_seconds: 129
- count: 5
date: '2025-12-06T17:50:22.346848'
notes: 'Missed: Q22, Q23, Q25'
score: 2
time_seconds: 92
name: 08-ordereddict
target_seconds: 240
pathlib-basics:
attempts:
- count: 16
date: '2025-12-16T11:57:34.648550'
notes: 'Missed: Q2, Q3, Q4, Q5, Q9, Q11, Q15'
score: 9
time_seconds: 482
- count: 16
date: '2025-12-06T18:33:21.539277'
notes: 'Missed: Q3, Q4, Q9, Q15'
score: 12
time_seconds: 242
name: 14-pathlib-basics
target_seconds: 480
pathlib-ops:
attempts:
- count: 12
date: '2025-12-16T12:07:08.366105'
notes: 'Missed: Q1, Q2, Q3, Q4, Q6, Q7, Q11, Q12'
score: 4
time_seconds: 259
- count: 12
date: '2025-12-06T18:37:35.607905'
notes: 'Missed: Q1, Q2, Q3, Q4, Q6, Q7, Q10, Q11, Q12'
score: 4
time_seconds: 176
name: 15-pathlib-ops
target_seconds: 360
regex:
attempts:
- count: 21
date: '2025-12-06T18:44:14.760397'
notes: 'Missed: Q2, Q4, Q10, Q13, Q15, Q20'
score: 15
time_seconds: 269
name: 16-regex
target_seconds: 630
regex-python:
attempts:
- count: 8
date: '2025-12-06T18:47:52.872385'
notes: 'Missed: Q1, Q2, Q3, Q5, Q7'
score: 3
time_seconds: 158
name: 17-regex-python
target_seconds: 240
sets:
attempts:
- count: 25
date: '2025-12-09T11:44:14.680215'
notes: 'Missed: Q16, Q17'
score: 23
time_seconds: 303
name: 19-sets
target_seconds: 750
sortedcontainers:
attempts:
- count: 13
date: '2025-12-13T10:05:12.007764'
notes: Perfect score
score: 13
time_seconds: 192
- count: 13
date: '2025-12-12T13:20:22.262492'
notes: 'Missed: Q2, Q4, Q7, Q8, Q10, Q12'
score: 8
time_seconds: 210
- count: 13
date: '2025-12-05T15:18:18.002663'
notes: 'Missed: Q6, Q10, Q12, Q13'
score: 9
time_seconds: 210
name: 10-sortedcontainers
target_seconds: 390
stacks-queues:
attempts:
- count: 16
date: '2025-12-05T14:21:24.772408'
notes: Perfect score
score: 16
time_seconds: 180
- count: 16
date: '2025-12-04T16:06:27.373471'
notes: 'Missed: create-queue, queue-enqueue, deque-push-front'
score: 13
time_seconds: 184
name: 05-stacks-queues
target_seconds: 480
strings:
attempts:
- count: 19
date: '2025-12-05T14:16:15.162630'
notes: Perfect score
score: 19
time_seconds: 145
- count: 19
date: '2025-12-04T15:59:54.452518'
notes: 'Missed: Q2 (chr not char), Q3 (isdigit not is_digit)'
score: 17
time_seconds: 193
- count: 19
date: '2025-12-04T15:59:31.105157'
notes: 'Missed: Q2, Q3'
score: 17
time_seconds: 193
- count: 19
date: '2025-12-03T19:42:55.951983'
notes: 'Q3: isdigit() not is_digit(); Q9: s in t not t.substr(s); Q10: s.find(substring)
not s.substr(t); Q15: s[::-1] not s.reverse(); Q16: s.strip(); Q17: s.split(delim)
not delim.split(s)'
score: 14
time_seconds: 269
name: 03-strings
target_seconds: 570
problems:
a_b_sqrt2:
attempts: []
chapter: 14_binary_search_trees
chapter_name: Binary Search Trees
file: 1-algorithm-problems/a_b_sqrt2.py
name: Enumerate extended integers
priority: P4
problem_number: '14.07'
absent_value_array:
attempts:
- date: '2025-12-16T14:15:43.759429'
optimal: false
solved: false
submissions: 1
time_minutes: 15
used_hints: false
used_solution: true
chapter: 11_searching
chapter_name: Searching
file: 1-algorithm-problems/absent_value_array.py
name: Find the missing IP address
priority: P2
problem_number: '11.09'
adding_credits:
attempts: []
chapter: 14_binary_search_trees
chapter_name: Binary Search Trees
file: 1-algorithm-problems/adding_credits.py
name: Add credits
problem_number: '14.11'
advance_by_offsets:
attempts: []
chapter: 05_arrays
chapter_name: Arrays
file: 1-algorithm-problems/advance_by_offsets.py
leetcode_difficulty: Medium
leetcode_name: Jump Game
leetcode_num: '55'
name: Advancing through an array
problem_number: '5.04'
alternating_array:
attempts: []
chapter: 05_arrays
chapter_name: Arrays
file: 1-algorithm-problems/alternating_array.py
leetcode_difficulty: Medium
leetcode_name: Wiggle Sort
leetcode_num: '280'
name: Computing an alternation
problem_number: '5.08'
anagrams:
attempts: []
chapter: 12_hash_tables
chapter_name: Hash Tables
file: 1-algorithm-problems/anagrams.py
name: 'Bootcamp: Hash Tables'
problem_number: '12.00'
api_pagination:
attempts: []
chapter: P4_api_interaction
chapter_name: API Interaction
file: 2-applied-problems/data/api_pagination.py
name: API Pagination Handler
problem_number: P4.01
apply_permutation:
attempts: []
chapter: 05_arrays
chapter_name: Arrays
file: 1-algorithm-problems/apply_permutation.py
leetcode_difficulty: Medium
leetcode_name: Next Permutation
leetcode_num: '31'
name: Permute the elements of an array
priority: P4
problem_number: '5.10'
arbitrage:
attempts: []
chapter: 24_honors_class
chapter_name: Honors Class
file: 1-algorithm-problems/arbitrage.py
name: Test if arbitrage is possible
problem_number: '24.35'
backtest_event_joiner:
attempts: []
chapter: T1_trading
chapter_name: Trading & Quant
file: 2-applied-problems/trading/backtest_event_joiner.py
name: Backtest Event Joiner
problem_number: T1.12
binary_feed_parser:
attempts: []
chapter: T1_trading
chapter_name: Trading & Quant
file: 2-applied-problems/trading/binary_feed_parser.py
name: Binary Feed Parser
problem_number: T1.10
binomial_coefficients:
attempts: []
chapter: 16_dynamic_programming
chapter_name: Dynamic Programming
file: 1-algorithm-problems/binomial_coefficients.py
name: Compute the binomial coefficients
problem_number: '16.04'
bonus:
attempts: []
chapter: 24_honors_class
chapter_name: Honors Class
file: 1-algorithm-problems/bonus.py
name: Compute fair bonuses
problem_number: '24.13'
bst_from_preorder:
attempts: []
chapter: 14_binary_search_trees
chapter_name: Binary Search Trees
file: 1-algorithm-problems/bst_from_preorder.py
leetcode_difficulty: Medium
leetcode_name: Construct Binary Search Tree from Preorder Traversal
leetcode_num: '1008'
name: Reconstruct a BST from traversal data
priority: P3
problem_number: '14.05'
bst_from_sorted_array:
attempts: []
chapter: 14_binary_search_trees
chapter_name: Binary Search Trees
file: 1-algorithm-problems/bst_from_sorted_array.py
leetcode_difficulty: Easy
leetcode_name: Convert Sorted Array to Binary Search Tree
leetcode_num: '108'
name: Build a minimum height BST from a sorted array
priority: P3
problem_number: '14.08'
bst_merge:
attempts: []
chapter: 24_honors_class
chapter_name: Honors Class
file: 1-algorithm-problems/bst_merge.py
name: Merge two BSTs
problem_number: '24.21'
bst_to_sorted_list:
attempts: []
chapter: 24_honors_class
chapter_name: Honors Class
file: 1-algorithm-problems/bst_to_sorted_list.py
name: Convert a BST to a sorted doubly linked list
problem_number: '24.20'
buy_and_sell_stock:
attempts:
- date: '2025-11-22T19:15:46.885950'
optimal: true
solved: true
submissions: 1
time_minutes: 5
used_hints: false
used_solution: false
- date: '2025-12-08T15:35:46.070433'
optimal: true
solved: true
submissions: 1
time_minutes: 6
used_hints: false
used_solution: false
chapter: 05_arrays
chapter_name: Arrays
file: 1-algorithm-problems/buy_and_sell_stock.py
leetcode_difficulty: Easy
leetcode_name: Best Time to Buy and Sell Stock
leetcode_num: '121'
name: Buy and sell a stock once
priority: P0
problem_number: '5.06'
buy_and_sell_stock_k_times:
attempts: []
chapter: 24_honors_class
chapter_name: Honors Class
file: 1-algorithm-problems/buy_and_sell_stock_k_times.py
leetcode_difficulty: Hard
leetcode_name: Best Time to Buy and Sell Stock IV
leetcode_num: '188'
name: Buy and sell a stock at most k times
problem_number: '24.03'
buy_and_sell_stock_twice:
attempts: []
chapter: 05_arrays
chapter_name: Arrays
file: 1-algorithm-problems/buy_and_sell_stock_twice.py
leetcode_difficulty: Hard
leetcode_name: Best Time to Buy and Sell Stock III
leetcode_num: '123'
name: Buy and sell a stock twice
problem_number: '5.07'
calendar_rendering:
attempts:
- date: '2025-12-17T13:25:49.371503'
optimal: true
solved: true
submissions: 2
time_minutes: 18
used_hints: false
used_solution: false
chapter: 13_sorting
chapter_name: Sorting
file: 1-algorithm-problems/calendar_rendering.py
name: Render a calendar
priority: P2
problem_number: '13.05'
circular_queue:
attempts:
- date: '2025-12-15T14:52:38.439210'
optimal: false
solved: true
submissions: 1
time_minutes: 28
used_hints: true
used_solution: false
chapter: 08_stacks_and_queues
chapter_name: Stacks and Queues
file: 1-algorithm-problems/circular_queue.py
leetcode_difficulty: Medium
leetcode_name: Design Circular Queue
leetcode_num: '622'
name: Implement a circular queue
priority: P2
problem_number: '8.07'
closest_int_same_weight:
attempts:
- date: '2025-11-15T11:20:57.015344'
notes: Started with wrong approach (clearing LSB). Needed hint about consecutive
differing bits.
optimal: true
solved: true
submissions: 2
time_minutes: 22
used_hints: true
used_solution: false
chapter: 04_primitive_types
chapter_name: Primitive Types
file: 1-algorithm-problems/closest_int_same_weight.py
name: Find a closest integer with the same weight
problem_number: '4.04'
collatz_checker:
attempts: []
chapter: 12_hash_tables
chapter_name: Hash Tables
file: 1-algorithm-problems/collatz_checker.py
name: Test the Collatz conjecture
problem_number: '12.11'
combinations:
attempts: []
chapter: 15_recursion
chapter_name: Recursion
file: 1-algorithm-problems/combinations.py
leetcode_difficulty: Medium
leetcode_name: Combinations
leetcode_num: '77'
name: Generate all subsets of size k
priority: P4
problem_number: '15.05'
confusion_metrics:
attempts: []
chapter: M5_evaluation
chapter_name: Evaluation
file: 2-applied-problems/ml/M5_evaluation/confusion_metrics.py
name: Confusion Matrix Metrics
problem_number: M5.03
convert_base:
attempts:
- date: '2025-11-27T20:13:40.154713'
optimal: true
solved: true
submissions: 2
time_minutes: 9
used_hints: true
used_solution: false
- date: '2025-12-09T16:43:40.690001'
optimal: true
solved: true
submissions: 1
time_minutes: 12
used_hints: false
used_solution: false
chapter: 06_strings
chapter_name: Strings
file: 1-algorithm-problems/convert_base.py
leetcode_difficulty: Easy
leetcode_name: Base 7
leetcode_num: '504'
name: Base conversion
priority: P1
problem_number: '6.02'
copy_posting_list:
attempts: []
chapter: 24_honors_class
chapter_name: Honors Class
file: 1-algorithm-problems/copy_posting_list.py
name: Copy a postings list
problem_number: '24.10'
count_bits:
attempts:
- date: '2025-11-13T19:21:48.654952'
notes: First try, needed hint on XOR trick
solved: true
submissions: 3
time_minutes: 15
used_hints: true
used_solution: false
chapter: 04_primitive_types
chapter_name: Primitive Types
file: 1-algorithm-problems/count_bits.py
name: 'Bootcamp: Primitive Types'
problem_number: '4.00'
count_inversions:
attempts: []
chapter: 24_honors_class
chapter_name: Honors Class
file: 1-algorithm-problems/count_inversions.py
name: Count inversions
problem_number: '24.24'
cross_entropy_loss:
attempts: []
chapter: M2_gradients
chapter_name: Gradients
file: 2-applied-problems/ml/M2_gradients/cross_entropy_loss.py
name: Cross-Entropy Loss & Gradient
problem_number: M2.02
csv_sales_report:
attempts:
- date: '2025-12-06T00:00:00.000000'
optimal: true
solved: true
submissions: 1
time_minutes: 10
used_hints: false
used_solution: false
chapter: P1_file_parsing
chapter_name: File Parsing
file: 2-applied-problems/data/csv_sales_report.py
name: CSV Sales Report
problem_number: P1.01
custom_transformer:
attempts: []
chapter: M4_pipelines
chapter_name: Feature Pipelines
file: 2-applied-problems/ml/M4_pipelines/custom_transformer.py
name: Custom sklearn Transformer
problem_number: M4.02
deadlock_detection:
attempts: []
chapter: 18_graphs
chapter_name: Graphs
file: 1-algorithm-problems/deadlock_detection.py
leetcode_difficulty: Medium
leetcode_name: Course Schedule
leetcode_num: '207'
name: Deadlock detection
problem_number: '18.04'
decision_tree:
attempts: []
chapter: M1_models
chapter_name: Models
file: 2-applied-problems/ml/M1_models/decision_tree.py
name: Decision Tree Classifier
problem_number: M1.05
defective_jugs:
attempts: []
chapter: 24_honors_class
chapter_name: Honors Class
file: 1-algorithm-problems/defective_jugs.py
name: Measure with defective jugs
problem_number: '24.26'
delete_from_list:
attempts: []
chapter: 07_linked_lists
chapter_name: Linked Lists
file: 1-algorithm-problems/delete_from_list.py
name: 'Bootcamp: Linked Lists'
problem_number: '7.00'
delete_kth_last_from_list:
attempts:
- date: '2025-12-14T15:04:08.704231'
optimal: true
solved: true
submissions: 1
time_minutes: 8
used_hints: false
used_solution: false
chapter: 07_linked_lists
chapter_name: Linked Lists
file: 1-algorithm-problems/delete_kth_last_from_list.py
leetcode_difficulty: Medium
leetcode_name: Remove Nth Node From End of List
leetcode_num: '19'
name: Remove the kth last element from a list
priority: P2
problem_number: '7.07'
delete_node_from_list:
attempts: []
chapter: 07_linked_lists
chapter_name: Linked Lists
file: 1-algorithm-problems/delete_node_from_list.py
leetcode_difficulty: Medium
leetcode_name: Delete Node in a Linked List
leetcode_num: '237'
name: Delete a node from a singly linked list
problem_number: '7.06'
descendant_and_ancestor_in_bst:
attempts: []
chapter: 14_binary_search_trees
chapter_name: Binary Search Trees
file: 1-algorithm-problems/descendant_and_ancestor_in_bst.py
name: Test if three BST nodes are totally ordered
problem_number: '14.09'
directory_path_normalization:
attempts: []
chapter: 08_stacks_and_queues
chapter_name: Stacks and Queues
file: 1-algorithm-problems/directory_path_normalization.py
leetcode_difficulty: Medium
leetcode_name: Simplify Path
leetcode_num: '71'
name: Normalize pathnames
priority: P4
problem_number: '8.04'
do_lists_overlap:
attempts: []
chapter: 07_linked_lists
chapter_name: Linked Lists
file: 1-algorithm-problems/do_lists_overlap.py
name: Test for overlapping lists---lists may have cycles
problem_number: '7.05'
do_terminated_lists_overlap:
attempts:
- date: '2025-12-14T14:51:19.594096'
optimal: false
solved: true
submissions: 1
time_minutes: 11
used_hints: false
used_solution: false
- date: '2025-12-14T14:51:52.108852'
optimal: true
solved: true
submissions: 1
time_minutes: 11
used_hints: false
used_solution: false
chapter: 07_linked_lists
chapter_name: Linked Lists
file: 1-algorithm-problems/do_terminated_lists_overlap.py
leetcode_difficulty: Easy
leetcode_name: Intersection of Two Linked Lists
leetcode_num: '160'
name: Test for overlapping lists---lists are cycle-free
priority: P2
problem_number: '7.04'
drawing_skyline:
attempts: []
chapter: 24_honors_class
chapter_name: Honors Class
file: 1-algorithm-problems/drawing_skyline.py
leetcode_difficulty: Hard
leetcode_name: The Skyline Problem
leetcode_num: '218'
name: Draw the skyline
problem_number: '24.25'
dutch_national_flag:
attempts:
- date: '2025-11-22T18:08:24.962323'
optimal: false
solved: false
submissions: 0
time_minutes: null
used_hints: false
used_solution: false
- date: '2025-12-08T15:24:50.528963'
optimal: true
solved: true
submissions: 1
time_minutes: 4
used_hints: false
used_solution: false
chapter: 05_arrays
chapter_name: Arrays
file: 1-algorithm-problems/dutch_national_flag.py
leetcode_difficulty: Medium
leetcode_name: Sort Colors
leetcode_num: '75'
name: The Dutch national flag problem
priority: P0
problem_number: '5.01'
element_appearing_once:
attempts: []
chapter: 24_honors_class
chapter_name: Honors Class
file: 1-algorithm-problems/element_appearing_once.py
name: Find an element that appears only once
problem_number: '24.17'
enumerate_balanced_parentheses:
attempts: []
chapter: 15_recursion
chapter_name: Recursion
file: 1-algorithm-problems/enumerate_balanced_parentheses.py
leetcode_difficulty: Medium
leetcode_name: Generate Parentheses
leetcode_num: '22'
name: Generate strings of matched parens
priority: P4
problem_number: '15.06'
enumerate_palindromic_decompositions:
attempts: []
chapter: 15_recursion
chapter_name: Recursion
file: 1-algorithm-problems/enumerate_palindromic_decompositions.py
leetcode_difficulty: Medium
leetcode_name: Palindrome Partitioning
leetcode_num: '131'
name: Generate palindromic decompositions
problem_number: '15.07'
enumerate_trees:
attempts: []
chapter: 15_recursion
chapter_name: Recursion
file: 1-algorithm-problems/enumerate_trees.py
leetcode_difficulty: Medium
leetcode_name: Unique Binary Search Trees II
leetcode_num: '95'
name: Generate binary trees
priority: P3
problem_number: '15.08'
euclidean_gcd:
attempts: []
chapter: 15_recursion
chapter_name: Recursion
file: 1-algorithm-problems/euclidean_gcd.py
name: 'Bootcamp: Recursion'
problem_number: '15.00'
evaluate_rpn:
attempts:
- date: '2025-12-14T15:27:03.507321'
optimal: false
solved: true
submissions: 1
time_minutes: 10
used_hints: true
used_solution: false
chapter: 08_stacks_and_queues
chapter_name: Stacks and Queues
file: 1-algorithm-problems/evaluate_rpn.py
leetcode_difficulty: Medium
leetcode_name: Evaluate Reverse Polish Notation
leetcode_num: '150'
name: Evaluate RPN expressions
priority: P2
problem_number: '8.02'
even_odd_array:
attempts: []
chapter: 05_arrays
chapter_name: Arrays
file: 1-algorithm-problems/even_odd_array.py
name: 'Bootcamp: Arrays'
problem_number: '5.00'
even_odd_list_merge:
attempts: []
chapter: 07_linked_lists
chapter_name: Linked Lists
file: 1-algorithm-problems/even_odd_list_merge.py
leetcode_difficulty: Medium
leetcode_name: Odd Even Linked List
leetcode_num: '328'
name: Implement even-odd merge
priority: P3
problem_number: '7.10'
exercise_assignment:
attempts: []
chapter: T1_trading
chapter_name: Trading & Quant
file: 2-applied-problems/trading/exercise_assignment.py
name: Exercise/Assignment Simulator
problem_number: T1.11
fee_calculator:
attempts: []
chapter: T1_trading
chapter_name: Trading & Quant
file: 2-applied-problems/trading/fee_calculator.py
name: Fee Schedule Calculator
problem_number: T1.08
fibonacci:
attempts: []
chapter: 16_dynamic_programming
chapter_name: Dynamic Programming
file: 1-algorithm-problems/fibonacci.py
name: 'Bootcamp: Dynamic Programming'
problem_number: '16.00'
file_organizer:
attempts: []
chapter: P6_system_scripts
chapter_name: System Scripts
file: 2-applied-problems/data/file_organizer.py
name: File Organizer
problem_number: P6.01
find_salary_threshold:
attempts: []
chapter: 13_sorting
chapter_name: Sorting
file: 1-algorithm-problems/find_salary_threshold.py
name: Compute a salary threshold
problem_number: '13.11'
first_missing_positive_entry:
attempts: []
chapter: 24_honors_class
chapter_name: Honors Class
file: 1-algorithm-problems/first_missing_positive_entry.py
leetcode_difficulty: Hard
leetcode_name: First Missing Positive
leetcode_num: '41'
name: Find the first missing positive entry
problem_number: '24.02'
fix_log_parser:
attempts: []
chapter: T1_trading
chapter_name: Trading & Quant
file: 2-applied-problems/trading/fix_log_parser.py
name: FIX Log Parser
problem_number: T1.06
gcd:
attempts: []
chapter: 24_honors_class
chapter_name: Honors Class
file: 1-algorithm-problems/gcd.py
name: Compute the greatest common divisor
problem_number: '24.01'
gradient_checker:
attempts: []
chapter: M2_gradients
chapter_name: Gradients
file: 2-applied-problems/ml/M2_gradients/gradient_checker.py
name: Numerical Gradient Checker
problem_number: M2.03
gradient_descent_variants:
attempts: []
chapter: M2_gradients
chapter_name: Gradients
file: 2-applied-problems/ml/M2_gradients/gradient_descent_variants.py
name: Gradient Descent Variants
problem_number: M2.01
graph_clone:
attempts: []
chapter: 18_graphs
chapter_name: Graphs
file: 1-algorithm-problems/graph_clone.py
leetcode_difficulty: Medium
leetcode_name: Clone Graph
leetcode_num: '133'
name: Clone a graph
priority: P4
problem_number: '18.05'