-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathinfo.json
1009 lines (1009 loc) · 46.5 KB
/
info.json
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
{
"algorithms": [
"Binary Search",
"Combinatorics",
"Data Structure",
"Divide and Conquer",
"Dynamic Programming",
"Expected value",
"Geometry",
"Graph and Tree",
"Greedy",
"Number Theory",
"Implementation",
"Interval",
"Segment Tree",
"String",
"Standard Template Library",
"Ternery Search"
],
"problems": {
"Binary Search": {
"LightOj": [
{
"algorithm": "Binary Search",
"problem link": "https://lightoj.com/problem/counting-triangles",
"problem name": "1307 Counting Triangles",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1307_Counting_Triangles.md",
"status": "done"
},
{
"algorithm": "Binary Search",
"problem link": "https://lightoj.com/problem/crossed-ladders",
"problem name": "1062 Crossed Ladders",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1062_Crossed_Ladders.md",
"status": "done"
}
],
"Toph": [
{
"algorithm": "NT,Trailling Zero",
"problem link": "https://toph.co/p/kitorp-and-his-love",
"problem name": "Kitorp and His Love",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/Toph/Kitorp_and_His_Love.md",
"status": "done"
},
{
"algorithm": "none",
"problem link": "https://toph.co/p/min-value",
"problem name": "Min Value",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/Toph/Min_Value.md",
"status": "done"
}
]
},
"Combinatorics": {
"LightOj": [
{
"algorithm": "Combinatorics",
"problem link": "https://lightoj.com/problem/problem-makes-problem",
"problem name": "1102 Problem Makes Problem",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1102_Problem_Makes_Problem.md",
"status": "done"
},
{
"algorithm": "Inclusion-exclusion",
"problem link": "https://lightoj.com/problem/helping-cicada",
"problem name": "1117_Helping_Cicada",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1117_Helping_Cicada.md",
"status": "done"
}
]
},
"Data Structure": {
"CSES": [
{
"algorithm": "Topological Sort",
"problem link": "https://cses.fi/problemset/task/1196",
"problem name": "Flight Routes",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/CSES/Flight_Routes.md",
"status": "done"
},
{
"algorithm": "Topological Sort",
"problem link": "https://cses.fi/problemset/task/1679",
"problem name": "Course Schedule",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/CSES/Course_Schedule.md",
"status": "done"
},
{
"algorithm": "Topological Sort",
"problem link": "https://cses.fi/problemset/task/1681",
"problem name": "Game Routes",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/CSES/Game_Routes.md",
"status": "done"
},
{
"algorithm": "Topological Sort",
"problem link": "https://cses.fi/problemset/task/1680",
"problem name": "Longest Flight Route",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/CSES/Longest_Flight_Route.md",
"status": "done"
}
],
"LightOj": [
{
"algorithm": "map, cumulative sum",
"problem link": "https://lightoj.com/problem/points-in-segments-ii",
"problem name": "1089 Points in Segments (II)",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1089_Points_in_Segments_(II).md",
"status": "done"
},
{
"algorithm": "Segtree Basic",
"problem link": "https://lightoj.com/problem/diablo",
"problem name": "1087 Diablo",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1087_Diablo.md",
"status": "done"
}
],
"Spoj": [
{
"algorithm": "Trie , XOR",
"problem link": "https://www.spoj.com/problems/SUBXOR/",
"problem name": "SubXor",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/Spoj/SubXor.md",
"status": "done"
}
]
},
"Divide and Conquer": {
"CodeForces": [
{
"algorithm": "Merge Sort Tree",
"problem link": "https://codeforces.com/problemset/problem/893/F",
"problem name": "Subtree Minimum Query",
"solution link": "not solved yet",
"status": "done"
}
],
"Hackerrank": [
{
"algorithm": "Merge sort tree",
"problem link": "https://www.hackerrank.com/challenges/coloring-tree/problem",
"problem name": "Coloring Tree",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/Hackerrank/Coloring_Tree.md",
"status": "done"
}
],
"Spoj": [
{
"algorithm": "Merge Sort and Seg tree",
"problem link": "https://www.spoj.com/problems/KQUERY/",
"problem name": "KQUERY - K-query",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/Spoj/KQUERY_-_K-query.md",
"status": "done"
}
],
"Toph": [
{
"algorithm": "Merge Sort tree basic",
"problem link": "https://toph.co/p/tree-queries",
"problem name": "Tree Queries",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/Toph/Tree_Queries.md",
"status": "done"
},
{
"algorithm": "Merge Sort Tree, Binary Search",
"problem link": "https://toph.co/p/exists-or-not-exists",
"problem name": "Exists or Not Exists",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/Toph/Exists_or_Not_Exists.md",
"status": "done"
}
]
},
"Dynamic Programming": {
"CSES": [
{
"algorithm": "Coin Change",
"problem link": "https://cses.fi/problemset/task/1635/",
"problem name": "Coin Combinations I",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/CSES/Coin_Combinations_I.md",
"status": "done"
},
{
"algorithm": "Coin Change",
"problem link": "https://cses.fi/alon/task/2183/",
"problem name": "Missing Coin Sum",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/CSES/Missing_Coin_Sum.md",
"status": "done"
}
],
"Codeforces": [
{
"algorithm": "Bitmask",
"problem link": "https://codeforces.com/problemset/problem/401/D",
"problem name": "Roman and Numbers",
"solution link": "not solved yet",
"status": "done"
}
],
"LightOj": [
{
"algorithm": "Bitmask",
"problem link": "https://lightoj.com/problem/painful-bases",
"problem name": "Painfull Bases",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/Painfull_Bases.md",
"status": "done"
},
{
"algorithm": "dp bitmask",
"problem link": "https://lightoj.com/problem/agent-47",
"problem name": "1037 Agent 47",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1037_Agent_47.md",
"status": "done"
},
{
"algorithm": "Bitmask",
"problem link": "https://lightoj.com/problem/marriage-ceremonies",
"problem name": "1011 Marriage Ceremonies",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1011_Marriage_Ceremonies.md",
"status": "done"
},
{
"algorithm": "Coin Change",
"problem link": "https://lightoj.com/problem/coin-change-i",
"problem name": "1231 Coin Change (I)",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1231_Coin_Change_(I).md",
"status": "done"
},
{
"algorithm": "coin-change",
"problem link": "https://lightoj.com/problem/coin-change-ii",
"problem name": "1232_Coin_Change_(II)",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1232_Coin_Change_(II).md",
"status": "done"
},
{
"algorithm": "combinatorics",
"problem link": "https://lightoj.com/problem/anagram-division",
"problem name": "1158_Anagram_Division",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1158_Anagram_Division.md",
"status": "done"
},
{
"algorithm": "Digit DP",
"problem link": "https://lightoj.com/problem/fast-bit-calculations",
"problem name": "1032_Fast_Bit_Calculations",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1032_Fast_Bit_Calculations.md",
"status": "done"
},
{
"algorithm": "LCS 3 string",
"problem link": "https://lightoj.com/problem/batman",
"problem name": "1159_Batman",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1159_Batman.md",
"status": "done"
},
{
"algorithm": "DP",
"problem link": "https://lightoj.com/problem/brush-3",
"problem name": "1017 Brush (III)",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1017_Brush_(III).md",
"status": "done"
},
{
"algorithm": "DP",
"problem link": "https://lightoj.com/problem/the-specials-menu",
"problem name": "1025_The_Specials_Menu",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1025_The_Specials_Menu.md",
"status": "done"
},
{
"algorithm": "DP",
"problem link": "https://lightoj.com/problem/pimp-my-ride",
"problem name": "1119_Pimp_My_Ride",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1119_Pimp_My_Ride.md",
"status": "done"
},
{
"algorithm": "DP",
"problem link": "https://lightoj.com/problem/divisible-group-sums",
"problem name": "1125_Divisible_Group_Sums",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1125_Divisible_Group_Sums.md",
"status": "done"
},
{
"algorithm": "DP",
"problem link": "https://lightoj.com/problem/how-many-zeroes",
"problem name": "1140_How_Many_Zeroes?",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1140_How_Many_Zeroes?.md",
"status": "done"
},
{
"algorithm": "DP",
"problem link": "https://lightoj.com/problem/neighbor-house-ii",
"problem name": "1217_Neighbor_House_(II)",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1217_Neighbor_House_(II).md",
"status": "done"
},
{
"algorithm": "DP",
"problem link": "https://lightoj.com/problem/collecting-gold",
"problem name": "1057 Collecting Gold",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1057_Collecting_Gold.md",
"status": "done"
},
{
"algorithm": "Bitmask",
"problem link": "https://lightoj.com/problem/brush-4",
"problem name": "1018 Brush (IV)",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1018_Brush_(IV).md",
"status": "done"
}
],
"SPOJ": [
{
"algorithm": "Digit DP",
"problem link": "https://www.spoj.com/problems/CPCRC1C/",
"problem name": "CPCRC1C - Sum of Digits",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/Spoj/CPCRC1C-Sum_Of_Digits.md",
"status": "done"
}
],
"Toph": [
{
"algorithm": "DP",
"problem link": "https://toph.co/p/reverse-hash",
"problem name": "Reverse Hash",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/Toph/Reverse_Hash.md",
"status": "done"
},
{
"algorithm": "Longest Increasing Subsequence",
"problem link": "https://toph.co/p/beautiful-subsequence",
"problem name": "Naughty Subsequence - V2.0",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/Toph/Naughty_Subsequence_-_V2.0.md",
"status": "done"
}
]
},
"Expected value": {
"LightOj": [
{
"algorithm": "Expected value",
"problem link": "https://lightoj.com/problem/discovering-gold",
"problem name": "1030_Discovering_Gold",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1030_Discovering_Gold.md",
"status": "done"
},
{
"algorithm": "Expected value",
"problem link": "https://lightoj.com/problem/a-dangerous-maze",
"problem name": "1027_A_Dangerous_Maze",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1027_A_Dangerous_Maze.md",
"status": "done"
},
{
"algorithm": "Expected value",
"problem link": "https://lightoj.com/problem/race-to-1-again",
"problem name": "Race to 1 Again",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1027_A_Dangerous_Maze.md",
"status": "done"
}
]
},
"Geometry": {
"LightOj": [
{
"algorithm": "Geometry",
"problem link": "https://lightoj.com/problem/expanding-rods",
"problem name": "1137_Expanding_Rods",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1137_Expanding_Rods.md",
"status": "done"
},
{
"algorithm": "geometry",
"problem link": "https://lightoj.com/problem/closest-distance",
"problem name": "1146 Closest Distance",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1146_Closest_Distance.md",
"status": "done"
}
]
},
"Graph and Tree": {
"Atcoder": [
{
"algorithm": "Basic",
"problem link": "https://atcoder.jp/contests/abc126/tasks/abc126_d",
"problem name": "Even Relation",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/Atcoder/Even_Relation.md",
"status": "done"
}
],
"CSES": [
{
"algorithm": "Bellman ford",
"problem link": "https://cses.fi/problemset/task/1197",
"problem name": "Cycle Finding",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/CSES/Cycle_Finding.md",
"status": "done"
},
{
"algorithm": "Floyd Warshall",
"problem link": "https://cses.fi/problemset/task/1672",
"problem name": "Shortest Routes II ",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/CSES/Shortest%20Routes%20II.md",
"status": "done"
},
{
"algorithm": "Centroid Decomposition",
"problem link": "https://cses.fi/problemset/task/2080/",
"problem name": "Fixed-Length Paths I",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/CSES/Fixed-Length_Paths_I.md",
"status": "done"
}
],
"CodeForces": [
{
"algorithm": "Centroid Decomposition",
"problem link": "https://codeforces.com/problemset/problem/161/D",
"problem name": "Distance in Tree",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/CodeForces/Distance_in_Tree.md",
"status": "done"
},
{
"algorithm": "DFS, small to large",
"problem link": "https://codeforces.com/contest/600/problem/E",
"problem name": "Lomsat gelral",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/CodeForces/Lomsat_gelral.md",
"status": "done"
},
{
"algorithm": "DSU",
"problem link": "https://codeforces.com/problemset/problem/1600/J",
"problem name": "Robot_Factory",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/CodeForces/Robot_Factory.md",
"status": "done"
}
],
"Codeforces": [
{
"algorithm": "Floyd Warshall",
"problem link": "http://codeforces.com/contest/25/problem/C",
"problem name": " Roads in Berland",
"solution link": "not solved yet",
"status": "done"
},
{
"algorithm": "Floyd Warshall",
"problem link": "http://codeforces.com/contest/33/problem/B",
"problem name": "String Problem ",
"solution link": "not solved yet",
"status": "done"
},
{
"algorithm": "Floyd Warshall",
"problem link": "http://codeforces.com/gym/101223",
"problem name": " Manic Moving",
"solution link": "not solved yet",
"status": "done"
},
{
"algorithm": "Floyd Warshall",
"problem link": "https://codeforces.com/problemset/problem/295/B",
"problem name": "Greg and Graph ",
"solution link": "https://codeforces.com/contest/295/submission/123709768",
"status": "done"
},
{
"algorithm": "Floyd Warshall",
"problem link": "http://codeforces.com/problemset/problem/21/D",
"problem name": "Traveling Graph ",
"solution link": "not solved yet",
"status": "done"
}
],
"LeetCode": [
{
"algorithm": "LCA",
"problem link": "https://leetcode.com/problems/kth-ancestor-of-a-tree-node/",
"problem name": "Kth Ancestor of a Tree Node",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LeetCode/Kth_Ancestor_of_a_Tree_Node.md",
"status": "done"
}
],
"LightOj": [
{
"algorithm": "Floyd Warshall",
"problem link": "http://lightoj.com/volume_showproblem.php?problem=1086",
"problem name": "Jogging Trails ",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/LOJ-1086-Jogging-Trails.md",
"status": "done"
},
{
"algorithm": "Floyd Warshall",
"problem link": "http://lightoj.com/volume_showproblem.php?problem=1221",
"problem name": "Travel Company ",
"solution link": "not solved yet",
"status": "done"
},
{
"algorithm": "BFS and DFS",
"problem link": "https://lightoj.com/problem/guilty-prince",
"problem name": "1012 Guilty Prince",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1012_Guilty_Prince.md",
"status": "done"
},
{
"algorithm": "bfs dfs",
"problem link": "https://lightoj.com/problem/hit-the-light-switches",
"problem name": "1034 Hit the Light Switches",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1034_Hit_the_Light_Switches.md",
"status": "done"
},
{
"algorithm": "BFS and DFS",
"problem link": "https://lightoj.com/problem/farthest-nodes-in-a-tree",
"problem name": "1094 Farthest Nodes in a Tree",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1094_Farthest_Nodes_in_a_Tree.md",
"status": "done"
},
{
"algorithm": "BFS and DFS",
"problem link": "https://lightoj.com/problem/one-way-roads",
"problem name": "1049 One Way Roads",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1049_One_Way_Roads.md",
"status": "done"
},
{
"algorithm": "BFS and DFS",
"problem link": "https://lightoj.com/problem/gathering-food",
"problem name": "1066 Gathering Food",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1066_Gathering_Food.md",
"status": "done"
},
{
"algorithm": "BFS and DFS",
"problem link": "https://lightoj.com/problem/beehives",
"problem name": "1437 Beehives ",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1437_Beehives.md",
"status": "done"
},
{
"algorithm": "BFS and DFS",
"problem link": "https://lightoj.com/problem/best-picnic-ever",
"problem name": "1111 Best Picnic Ever",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1111_Best_Picnic_Ever.md",
"status": "done"
},
{
"algorithm": "bfs basic lv 2",
"problem link": "https://lightoj.com/problem/escape",
"problem name": "1185 Escape",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1185_Escape.md",
"status": "done"
},
{
"algorithm": "BFS and DFS",
"problem link": "https://lightoj.com/problem/mafia",
"problem name": "1219 Mafia",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1219_Mafia.md",
"status": "done"
},
{
"algorithm": "BFS and DFS",
"problem link": "https://lightoj.com/problem/jane-and-the-frost-giants",
"problem name": "1175 Jane and the Frost Giants",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1175_Jane_and_the_Frost_Giants.md",
"status": "done"
},
{
"algorithm": "BFS and DFS",
"problem link": "https://lightoj.com/problem/power-puff-girls",
"problem name": "1238 Power Puff Girls",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1238_Power_Puff_Girls.md",
"status": "done"
},
{
"algorithm": "BFS and DFS",
"problem link": "https://lightoj.com/problem/the-crystal-maze",
"problem name": "1337 The Crystal Maze",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1337_The_Crystal_Maze.md",
"status": "done"
},
{
"algorithm": "dfs",
"problem link": "https://lightoj.com/problem/a-perfect-murder",
"problem name": "1201_A_Perfect_Murder",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1201_A_Perfect_Murder.md",
"status": "done"
},
{
"algorithm": "Diameter of Tree",
"problem link": "https://lightoj.com/problem/farthest-nodes-in-a-tree",
"problem name": "1094 Farthest Nodes in a Tree",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1094_Farthest_Nodes_in_a_Tree.md",
"status": "done"
},
{
"algorithm": "DSU",
"problem link": "https://lightoj.com/problem/civil-and-evil-engineer",
"problem name": "1029_Civil_and_Evil_Engineer",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1029_Civil_and_Evil_Engineer.md",
"status": "done"
},
{
"algorithm": "MST",
"problem link": "https://lightoj.com/problem/road-construction",
"problem name": "1041 Road Construction",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1041_Road_Construction.md",
"status": "done"
},
{
"algorithm": "MST",
"problem link": "https://lightoj.com/problem/donation",
"problem name": "1040 Donation",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1040_Donation.md",
"status": "done"
}
],
"Spoj": [
{
"algorithm": "Floyd Warshall",
"problem link": "http://www.spoj.com/problems/INGRED/",
"problem name": " Ingredients",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/Spoj/INGRED%20-%20Ingredients.md",
"status": "done"
},
{
"algorithm": "Floyd Warshall",
"problem link": "http://www.spoj.com/problems/CHICAGO/",
"problem name": " 106 miles to Chicago",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/Spoj/CHICAGO-106_miles_to_Chicago.md",
"status": "done"
},
{
"algorithm": "Floyd Warshall",
"problem link": "http://www.spoj.com/problems/ARBITRAG/",
"problem name": " Arbitrage",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/Spoj/ARBITRAG%20-%20Arbitrage.md",
"status": "done"
},
{
"algorithm": "Floyd Warshall",
"problem link": "https://www.spoj.com/problems/SOCIALNE/",
"problem name": "SOCIALNE - Possible Friends ",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/Spoj/SOCIALNE%20-%20Possible%20Friends.md",
"status": "done"
},
{
"algorithm": "Floyd Warshall",
"problem link": "http://www.spoj.com/problems/ROHAAN/",
"problem name": " Defend the Rohan",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/Spoj/ROHAAN%20-%20Defend%20The%20Rohan.md",
"status": "done"
},
{
"algorithm": "BFS and DFS",
"problem link": "https://www.spoj.com/problems/PARADOX/",
"problem name": "PARADOX Paradox",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/Spoj/PARADOX_Paradox.md",
"status": "done"
},
{
"algorithm": "BFS",
"problem link": "https://www.spoj.com/problems/CCHESS/",
"problem name": "CCHESS_COSTLY_CHESS",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/Spoj/CCHESS_COSTLY_CHESS.md",
"status": "done"
},
{
"algorithm": "BFS",
"problem link": "https://www.spoj.com/problems/AKBAR/",
"problem name": "AKBAR_-_Akbar_,_The_great",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/Spoj/AKBAR_-_Akbar_,_The_great.md",
"status": "done"
}
],
"Toph": [
{
"algorithm": "Floyd Warshall",
"problem link": "https://toph.co/p/kingdom-of-code",
"problem name": "Kingdom of Coden",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/Toph/Kingdom_of_Code.md",
"status": "done"
},
{
"algorithm": "DFS Basic",
"problem link": "https://toph.co/p/covid-19-outbreak",
"problem name": "COVID-19 Outbreak",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/Toph/COVID-19_Outbreak.md",
"status": "done"
},
{
"algorithm": "DSU XOR",
"problem link": "https://toph.co/p/hashing",
"problem name": "Hashing",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/Toph/Hashing.md",
"status": "done"
},
{
"algorithm": "Lowest common ancestor",
"problem link": "https://toph.co/p/static-tree",
"problem name": "Static Tree",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/Toph/Static_tree.md",
"status": "done"
}
],
"UVA": [
{
"algorithm": "Floyd Warshall",
"problem link": "https://vjudge.net/problem/UVA-821",
"problem name": " Page Hopping UVA - 821 ",
"solution link": "not solved yet",
"status": "done"
},
{
"algorithm": "Floyd Warshall",
"problem link": "https://vjudge.net/problem/UVA-10724",
"problem name": " Road Construction",
"solution link": "not solved yet",
"status": "done"
},
{
"algorithm": "Floyd Warshall",
"problem link": "https://vjudge.net/problem/UVA-117",
"problem name": "T he Postal Worker Rings Once ",
"solution link": "not solved yet",
"status": "done"
},
{
"algorithm": "Floyd Warshall",
"problem link": "https://vjudge.net/problem/UVA-1198",
"problem name": "he Geodetic Set Problem",
"solution link": "not solved yet",
"status": "done"
},
{
"algorithm": "Floyd Warshall",
"problem link": "https://vjudge.net/problem/UVA-10048",
"problem name": "Audiophobia ",
"solution link": "not solved yet",
"status": "done"
},
{
"algorithm": "Floyd Warshall",
"problem link": "https://vjudge.net/problem/UVA-125",
"problem name": "Numbering Paths ",
"solution link": "not solved yet",
"status": "done"
},
{
"algorithm": "Floyd Warshall",
"problem link": "https://vjudge.net/problem/UVA-423",
"problem name": "MPI Maelstrom ",
"solution link": "not solved yet",
"status": "done"
},
{
"algorithm": "Floyd Warshall",
"problem link": "https://vjudge.net/problem/UVA-1416",
"problem name": " Warfare And Logistics",
"solution link": "not solved yet",
"status": "done"
},
{
"algorithm": "Floyd Warshall",
"problem link": "https://vjudge.net/problem/UVA-1233",
"problem name": "USHER ",
"solution link": "not solved yet",
"status": "done"
},
{
"algorithm": "Floyd Warshall",
"problem link": "https://vjudge.net/problem/UVA-10793",
"problem name": "The Orc Attack ",
"solution link": "not solved yet",
"status": "done"
},
{
"algorithm": "Floyd Warshall",
"problem link": "https://vjudge.net/problem/UVA-10099",
"problem name": "The Tourist Guide ",
"solution link": "not solved yet",
"status": "done"
},
{
"algorithm": "Floyd Warshall",
"problem link": "https://vjudge.net/problem/UVA-869",
"problem name": "Airline Comparison ",
"solution link": "not solved yet",
"status": "done"
},
{
"algorithm": "Floyd Warshall",
"problem link": "https://vjudge.net/problem/UVA-13211",
"problem name": "Geonosis ",
"solution link": "not solved yet",
"status": "done"
},
{
"algorithm": "Floyd Warshall",
"problem link": "https://vjudge.net/problem/UVA-12179",
"problem name": "Randomly-priced Tickets ",
"solution link": "not solved yet",
"status": "done"
},
{
"algorithm": "bfs",
"problem link": "https://vjudge.net/problem/UVA-336",
"problem name": "336_A_Node_Too_Far_",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/UVA/336_A_Node_Too_Far_.md",
"status": "done"
}
]
},
"Greedy": {
"Codechef": [
{
"algorithm": "STL - stack",
"problem link": "https://www.codechef.com/LRNDSA02/problems/ZCO15004",
"problem name": "ZCO15004 Rectangle",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/Codechef/ZCO15004_Rectangle.md",
"status": "done"
}
]
},
"Implementation": {
"Toph": [
{
"algorithm": "none",
"problem link": "https://toph.co/p/ice-cream-of-montu-mia-again",
"problem name": "Ice-Cream of Montu Mia Again!",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/Toph/Ice-Cream_of_Montu_Mia_Again!.md",
"status": "done"
}
]
},
"Interval": {
"CSES": [
{
"algorithm": "Prefix Sum",
"problem link": "https://cses.fi/alon/task/1629",
"problem name": "Movie Festival",
"solution link": "not solved yet",
"status": "done"
}
],
"Spoj": [
{
"algorithm": "Interval",
"problem link": "https://www.spoj.com/problems/INTERVA2/cstart=10",
"problem name": "INTERVA2 - Interval Challenge",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/Spoj/INTERVA2-Interval_Challenge.md",
"status": "done"
}
]
},
"Number Theory": {
"LightOj": [
{
"algorithm": "Number Theory",
"problem link": "https://lightoj.com/problem/bank-robbery",
"problem name": "1163_Bank_Robbery",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1163_Bank_Robbery.md",
"status": "done"
},
{
"algorithm": "Inverse Modulo",
"problem link": "https://lightoj.com/problem/efficient-pseudo-code",
"problem name": "1054 Efficient Pseudo Code",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1054_Efficient_Pseudo_Code.md",
"status": "done"
}
],
"Spoj": [
{
"algorithm": "Trailling Zero",
"problem link": "https://www.spoj.com/problems/HS08PAUL/",
"problem name": "HS08PAUL - A conjecture of Paul Erd\u0151s",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/Spoj/HS08PAUL_A_conjecture_of_Paul_Erd\u0151s.md",
"status": "done"
}
],
"Toph": [
{
"algorithm": "Trailling Zero",
"problem link": "https://toph.co/p/kitorp-and-his-love",
"problem name": "Kitorp and His Love",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/Toph/Kitorp_and_His_Love.md",
"status": "done"
},
{
"algorithm": "Prefix Sum",
"problem link": "https://toph.co/p/bi-element-subsequence",
"problem name": "Bi-Element Subsequence",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/Toph/Bi-Element_Subsequence.md",
"status": "done"
}
]
},
"Segment Tree": {
"LightOj": [
{
"algorithm": "Segment Tree",
"problem link": "https://lightoj.com/problem/horrible-queries",
"problem name": "1164_Horrible_Queries",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1164_Horrible_Queries.md",
"status": "done"
},
{
"algorithm": "Bitmask",
"problem link": "https://lightoj.com/problem/min-max-roads",
"problem name": "1162 Min Max Roads",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1162_Min_Max_Roads.md",
"status": "done"
},
{
"algorithm": "segment tree",
"problem link": "https://lightoj.com/problem/array-queries",
"problem name": "1082_Array_Queries",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1082_Array_Queries.md",
"status": "done"
},
{
"algorithm": "Segment tree",
"problem link": "https://lightoj.com/problem/computing-fast-average",
"problem name": "1183_Computing_Fast_Average",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1183_Computing_Fast_Average.md",
"status": "done"
},
{
"algorithm": "offline",
"problem link": "https://lightoj.com/problem/fast-queries",
"problem name": "1188 Fast Queries",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1188_Fast_Queries.md",
"status": "done"
}
],
"Toph": [
{
"algorithm": "Basic",
"problem link": "https://toph.co/p/nothing-is-absolute-everything-is-relative",
"problem name": "Nothing Is Absolute, Everything Is Relative!",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/Toph/Nothing_Is_Absolute,_Everything_Is_Relative!.md",
"status": "done"
}
]
},
"Standard Template Library": {
"CSES": [
{
"algorithm": "next_permutation",
"problem link": "https://cses.fi/alon/task/1622/",
"problem name": "Creating Strings",
"solution link": "not solved yet",
"status": "done"
}
],
"LightOj": [
{
"algorithm": "next_permutation",
"problem link": "https://lightoj.com/problem/discovering-permutations",
"problem name": "1023 Discovering Permutations",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/LightOj/1023_Discovering_Permutations.md",
"status": "done"
}
],
"spoj": [
{
"algorithm": "stack",
"problem link": "https://www.spoj.com/problems/ONP/",
"problem name": "ONP - Transform the Expression",
"solution link": "not solved yet",
"status": "done"
},
{
"algorithm": "Trie",
"problem link": "https://www.spoj.com/problems/TRYCOMP/",
"problem name": "TRYCOMP - Try to complete",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/Spoj/TRYCOMP_-_Try_to_complete.md",
"status": "done"
}
]
},
"String": {
"Codeforces": [
{
"algorithm": "KMP LPS",
"problem link": "https://codeforces.com/contest/25/problem/E",
"problem name": "Test",
"solution link": "/Mestu-Paul/MyProgramming/blob/master/CodeForces/Test.md",
"status": "done"
}
]
},
"Ternery Search": {
"LightOj": [
{
"algorithm": "geometry",