All roadmaps
DSA
Competitive Programming
Advanced problem solving — segment trees, graph algorithms, number theory for CP contests.
Duration
24 weeks
Difficulty
Hard
Goal
CF/LC Expert
Modules
9 • 52 topics
Full Syllabus
Every module and topic in this roadmap.
1
Number Theory
Primes & SieveGCD (Euclidean)Modular ArithmeticFermat's Little TheoremCRTEuler's Totient
2
Combinatorics
nCr & nPr Mod InverseStars and BarsCatalan NumbersInclusion-ExclusionPigeonhole
3
Advanced Graphs
SCC (Tarjan, Kosaraju)Bridges & ArticulationEuler PathMax FlowBipartite MatchingLCA (Binary Lifting)
4
Advanced Trees
Segment Trees + LazyFenwick TreeMerge Sort TreeHLDCentroid DecompositionPersistent Segment Trees
5
String Algorithms
KMP & ZRabin-KarpSuffix Array & LCPAho-CorasickTrie ProblemsManacher's
6
Advanced DP
Bitmask DPDigit DPDP on TreesCHTKnuth OptD&C DPSOS DP
7
Geometry
Convex HullLine SweepPoint in PolygonClosest PairPolygon Area
8
Game Theory & Misc
Sprague-GrundyNimMatrix ExponentiationFFTMo's AlgorithmSqrt Decomposition
9
Contest Strategy
CF Rating StrategyTime ManagementReading ProblemsDebugging FastUpsolving
Prerequisites
Strong DSA foundation
Start learning today
Unlock the Premium Vault to get curated problems, quizzes, and mentor-crafted notes for every module.