Course Content

Stage-1:
=====
Intro to CP, time complexity, basic concepts, Searching, Sorting, CP Basic techniques, etc.
Prefix Sum, Binary Search, Euler Totient Function.

Stage-2:
=====
Primes, Binary Exponentiation, LDE, etc.
Sieve, Segmented Sieve, Wilson’s Theorem.
Modular Arithmetic, Combinatorics.
Bit Manipulation, Shortcuts used in CP.

Stage-3:
=====
Recursion.
Backtracking(Basic to Advanced).

Stage-4:
=====
Stack, Queue, Priority Queue.
Divide and Conquer and its related algorithms.

Stage-5:
=====
Greedy Algorithms.
String Algorithms.

Stage-6:
=====
Trees (Covering all algorithms and tricks related).
Breadth first search.
Depth first search.

Stage-7:
======
Graphs (Covering all algorithms and tricks related).

Stage-8:
=====
Dynamic Programming-I (Basic Medium DP).
Dynamic Programming-II (Hard DP – Probability DP, Digit DP, Bitmask DP).

Stage-9:
=====
Disjoint Set and Sparse Table.
Fenwick Trees/BIT.
Segment Tree (Complete).

Stage-10:
======
LCA.
Sqrt Decomposition.
Mo’s Algorithm.