-
Notifications
You must be signed in to change notification settings - Fork 0
/
cppath.rtf
148 lines (148 loc) · 5.33 KB
/
cppath.rtf
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
{\rtf1\ansi\ansicpg1252\deff0\nouicompat\deflang16393{\fonttbl{\f0\fnil\fcharset0 Calibri;}}
{\*\generator Riched20 10.0.18362}\viewkind4\uc1
\pard\sa200\sl276\slmult1\f0\fs22\lang9 Basic\par
----------\par
1: Pattern printing problems\par
2: Analysis of time complexity\par
3: Linear Search problems\par
4: Circular array using simple array\par
5: Palidrom, Perfect number\par
6: Simple Hashing problems\par
7: Prefix Sum Problems 1D/2D\par
8: Sliding window technich (1/5)\par
\par
Intermewdiate\par
----------------\par
1: Binary Search problesm (2/5)\par
2: Find GCD of 2 numbers in LogN (Euclined and Extended euclined algo)\par
3: Prime in Sqrt(n) complexity \par
4: Seive of Eratosthenes\par
5: Segmented Seive\par
6: Finding the prime factorization of a number in logn per query\par
7: Euler Totient function\par
8: Fermet Little theorem\par
\par
Number Theory\par
---------------\par
1: Finding x^n in LogN\par
2: Modular Arithmetic\par
3: Module Inverse of a number\par
4: Chines remainder theorem\par
5: Factorial Modulo Mod\par
6: Finding nCr & nPr in queries\par
7: Inclusion Exclusion principle\par
\par
\par
Some Advanced\par
---------------\par
1: Learn about basic sorting Algorithms (Bubbel, Selectiom, Insertion)\par
2: Constructive and having swap terms in it\par
3: Bit Manupulation problems(Left shift,Right shift, Set bit, MSB LSB etc) (Hackerearth as good tuts)\par
4: Power set of a given array or string using BIT\par
5: Number of subarray with XOR as ZERO (Not alogirithm, but a nust do problem)\par
\par
6: Greedy Algoriths Tag\par
7: Kadan's Algorithms and problem related to them\par
8: Job sequesnce and activity selection problem\par
\par
\par
Recursion\par
-----------\par
\par
1: Recurssion probelms like finding factorial \par
2: Implement Binary search using recursion\par
3: Implement modular exponent\par
4: Solve recursion problem like finding subset with given sum and other problesm\par
\par
Advanced\par
---------\par
1: Learn Merge Sort & Quick sort algorithms\par
2: Do backtracking problems like Sudoku and N-Queen problem (Help in DP path problems)\par
3: Meet in the middle algo and probs\par
4: Devide & Conquer problesm on Codeforces\par
5: Find next greater / Next samller element using stack\par
6: problesm related to paranthesis\par
7: Largest ractangular area in Histogram\par
8: Probleam related to Heap (Priority Queue)\par
\par
Practice Hard on above problesm\par
\par
More Advanced Don't GiveUP (1-4 hr in a problem)\par
-------------------------------------------------\par
1: Hashing on strings, know wh ncollision happens (cpalgorithm site)\par
2: Rabin karp algo\par
3: Prefix function\par
4: KMP Algo\par
5: Z-Function\par
6: Manacher's Algo (Solve bunch of problem in above topic)\par
\par
Trees\par
-------------\par
1: Tree / Graph representation\par
2: DFS/BFS traversel in tree /graph\par
3: Diameter of a tree/Height/\par
4: Euler TOur fo tree\par
5: Finding LCA using Euler Tour / Binary Lifting\par
6: DIstance b/w two nodes\par
7: Subtree Problems (Solve prob on abos tree prob)\par
\par
Graph\par
------\par
1: Connected Components\par
2: Topilogical sort\par
3: Cyclic detection in graph\par
4: Bipartite check in graph\par
5: SCC using Kosaraju's alog\par
6: Dijkarta's Algo\par
7: Belmenford Algo\par
8: Floyd warshall algo (Solver more problems on above topic - Hackerearht/Codeforce)\par
\par
9: Bridge in Grapgh\par
10: Articulation point in graph\par
11: Minimum spanning tree & kruskal algo\par
12: Prim's Alog\par
13: 0/1 BFS in linear time (cpalgo)\par
14: Finding bridgesin graph (Solve prob)\par
\par
Dynamic Programming\par
--------------------\par
1: Start with Recusion & Memoization with strong knowledge\par
2: Knapsack prob solve\par
3: Solve AtCoder Educational contest on DP 26/26 solve\par
4: Solve problem from SPOJ then Codeforces\par
5: Understand how we write recurrence for Digit DP(CF blog)\par
6: Read DP with bitmasks and solve on hackerearth\par
7: DP in trees (Rajit jain video)\par
8: SOS DP\par
9: Practice More\par
\par
More\par
------\par
1: Disjoint Set(Using all optimizations)\par
2: Offline Quesries using Disjoint Set\par
3: Kruskal's Alog\par
4: Sparse Table (Not Imp)\par
5: Fenwick Tree (Read Update Trick also)\par
6: Binary Lifting on fenwick tree (More Solve prob)\par
\par
And More\par
---------\par
1: Matrix Exponentiation\par
2: Sqrt Decomposition\par
3: Update and query operations\par
4: Mo's Algo (Codeforce blog)\par
5: Mo's Algo on Trees\par
6: Segment Tree (Most Imp topic - Range queries and point updates)\par
7: Lazy propogation in segment tress\par
\par
This help you tille E- level on Codeforces as least\par
\par
At Last\par
---------\par
1: Sprague-Grundy Theorem\par
2: Flows and related prob\par
3: Heavy light decomposition\par
4: Convex Hull Alog\par
5: FFT/NTT\par
}