-
Notifications
You must be signed in to change notification settings - Fork 692
/
Extra
121 lines (93 loc) · 6.05 KB
/
Extra
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
-AdHoc
//Problem 1 (Pending): https://www.codechef.com/ICMT2019/problems/ICM08
//Problem 2: https://www.codechef.com/DCC2019/problems/DCC4
//Problem 3: https://codeforces.com/problemset/problem/884/D
-BIT:
//Problem 1 (Count of distinct elements): https://www.hackerrank.com/contests/university-codesprint-4/challenges/unique-art/problem
//Solution 1: http://p.ip.fi/T9YM
-BFS
//Problem 1 (Multiple of number not containing some digits): https://www.spoj.com/problems/MULTII/
//Problem 2 (DP to BFS): https://codeforces.com/problemset/problem/369/D
-Binary Search
//Problem 1: https://codeforces.com/contest/1168/problem/A
-Dealing with periodic repeats:
//Problem 1: https://codeforces.com/problemset/problem/173/A
//Problem 2: https://codeforces.com/contest/863/problem/C
-DP Problems:
//Problem 1: https://codeforces.com/contest/214/problem/D
//Problem 2: https://codeforces.com/problemset/problem/137/D
//Problem 3: https://codeforces.com/contest/229/problem/D
//Problem 4 (Mutually Dependent Recurrence): https://www.hackerrank.com/challenges/alien-languages/problem
//Problem 5: https://codeforces.com/contest/489/problem/F
//Problem 6: http://acm.timus.ru/problem.aspx?num=1526&space=1
//Problem 7 (Pair DP): https://codeforces.com/problemset/problem/730/J
//Problem 8 (Math DP): https://codeforces.com/problemset/problem/403/D
//Problem 9 (Strings cost): https://codeforces.com/problemset/problem/543/C
//Problem 10 (Passing through K1 points in Grid and Avoiding K2 points): https://www.codechef.com/CROS2020/problems/COCR102 (Editorial: https://discuss.codechef.com/t/editorial-time-travel/69326)
-DP on Tree:
//Problem 1 (Minimum Vertex Cover + Number of Ways): https://www.spoj.com/problems/VOCV/
//Problem 2 (Number of subtrees with diameter <=K): https://www.spoj.com/problems/CNTTREE/
//Problem 3: https://codeforces.com/problemset/problem/815/C
//Problem 4 (Smaller to Larger merging): https://csacademy.com/contest/round-31/task/uniform-trees/
//Problem 5 (Vaults): https://codeforces.com/problemset/problem/855/C
//Problem 6 (Game on Tree): https://codeforces.com/problemset/problem/538/E
//Problem 7: https://codeforces.com/problemset/problem/1223/E
-DFS
//Problem 1 (Virtual Nodes): https://codeforces.com/contest/821/problem/D
//Problem 2 (Missing Edges): https://codeforces.com/contest/920/problem/E
-DFS in 2D Grid:
//Problem 1: https://codeforces.com/contest/616/problem/C
-Flows:
//Problem 1 (Remove min number of vertices such that shortest path > K): https://icpcarchive.ecs.baylor.edu/index.php?option=onlinejudge&Itemid=99999999&category=311&page=show_problem&problem=2323
(Probability):
//Problem 1: https://codeforces.com/contest/513/problem/G2
//Problem 2: https://www.codechef.com/GWR17ROL/problems/KALADIN/
//Problem 3: https://codeforces.com/contest/280/problem/C
-GCD Inclusion Exclusion:
//Problem 1: https://codeforces.com/contest/548/problem/E
//Problem 2: https://codeforces.com/contest/839/problem/D
//Problem 3: https://www.codechef.com/ONIG2019/problems/BIT_CSUM/
//Solution 3: https://www.codechef.com/viewsolution/23676665
//Problem 4: https://www.hackerrank.com/contests/w3/challenges/gcd-product/problem
-Graph Theory:
//Problem 1 (Diameter logic): https://codeforces.com/contest/337/problem/D
//Problem 2 (Updating diameter): https://codeforces.com/problemset/problem/379/F
//Problem 3: https://codeforces.com/contest/1040/problem/E
//Problem 4: (DSU with Undo + Divide and Conquer): https://codeforces.com/contest/813/problem/F
//Problem 5 (Points on Diameter etc): https://codeforces.com/problemset/problem/911/F
-Hashing:
//Problem 1 (Xor based Hash): https://codeforces.com/problemset/problem/154/C
-Math;
//Problem 1 (Pending): https://www.codechef.com/ICMT2019/problems/ICM06
//Problem 2 (Negative base): https://codeforces.com/contest/934/problem/D
//Problem 3 (Principle of Inclusion Exclusion): https://codeforces.com/contest/1228/problem/E
-Randomized:
//Problem 1: https://codeforces.com/problemset/problem/1310/D
-Smart Greedy:
//Problem 1: https://codeforces.com/contest/447/problem/D
//Problem 2 (Own Comparator): https://codeforces.com/contest/922/standings/friends/true
-Random Good Questions:
//Problem 1 (Math): https://codeforces.com/contest/396/problem/B
//Problem 2 (Binary Search with Consecutive Prefix Sums): https://codeforces.com/contest/837/problem/F
//Problem 3 (DP with Consecutive Prefix Sums): https://codeforces.com/contest/57/problem/C
//Problem 4 (Updating indices of a particular set): https://codeforces.com/contest/348/problem/C
//Problem 5 (Perfect Powers in a range): https://codeforces.com/problemset/problem/955/C
//Problem 6 (D length Jumps in Intervals): https://atcoder.jp/contests/arc068/tasks/arc068_c
//Problem 7 (Converging K points to Median - Cost): https://www.codechef.com/viewsolution/23192706
//Problem 8 (DFS with missing edges): https://codeforces.com/contest/653/problem/E
//Problem 9 (Interactive - Tree Labelling): https://codeforces.com/contest/1075/problem/D
//Problem 10 (100 length palindrome): https://codeforces.com/contest/335/problem/B
//Problem 11 (Interactive):
-To Copy Paste in Future:
//Problem 1 (Getting a sequence of + and - by using a sequence of - operationss): http://p.ip.fi/6t7b
//Problem 2 (Number of ways to place elements such that adjacent are different and given L and R) : https://www.codechef.com/BLUP2019/problems/AHAPH/
//Problem 3 (Merge Sort Tree): https://codeforces.com/contest/369/problem/E
//Problem 4 ([N/x] ranges): https://www.hackerrank.com/contests/hourrank-7/challenges/tile-painting-revisited/problem
//Problem 5 (KMP + DP): https://codeforces.com/problemset/problem/1163/D
//Problem 6 (Matrix + Linearity of Exp): https://codeforces.com/problemset/problem/1042/E
//Problem 7 (Rerooting): https://codeforces.com/contest/1187/problem/E
//Problem 8 (Minimum Enclosing Sphere): https://codeforces.com/problemset/problem/106/E
//Problem 9 (Optimal Scheduling): https://codeforces.com/contest/802/problem/B
(https://www.hackerearth.com/practice/math/number-theory/basic-number-theory-2/practice-problems/algorithm/numbers-summation/)
Resources:
https://www.careerbless.com/aptitude/qa/permutations_combinations_imp7.php