THE ICPC LEARNING PATH
Course I materials.
Advanced guided roadmaps.
Use the published Course I materials, then follow committee-approved topic maps paired with maintained learn–build–practice–verify modules for Courses II–IV.
YOUR ROUTE
Learn in the order that compounds.
Each course assumes the instincts built in the one before it. Follow the sequence or use the topic map to diagnose a specific gap.
FOUNDATIONS
Course I
Turn programming fluency into contest fluency. Learn the core patterns that unlock most beginner and early-regional problems.
- Complexity & language essentials
- Teamwork & online resources
- Bits & prefix sums
- Greedy & brute force
- Math & graphs
- Binary & ternary search
- Dynamic programming
- Geometry & sorting
REGIONAL
Course II
Build the algorithmic toolkit expected at serious regional competition: structured data, deeper graphs, and faster mathematical reasoning.
- DSU, Fenwick & segment trees
- 2-SAT, SCC & BCC
- Network flow
- Euler tour & LCA
- Bitmask and 2D DP
- Convex hull & angle sweep
- Modular arithmetic & CRT
- Matrix exponentiation & linear algebra
Full materials: not yet published; no release date has been announced. Use the mapped syllabus with the interim practice collections below.
- Review the committee topic map.
- Study each topic with CP-Algorithms or USACO Guide.
- Solve an intermediate set in the mapped practice index.
- Revisit missed topics after a timed contest.
CHAMPIONSHIP
Course III
Connect advanced structures, string algorithms, geometry, and optimization into reusable championship-level techniques.
- HLD & centroid decomposition
- Tree DP & DP optimization
- MCMF & half-plane intersection
- KMP, Aho–Corasick & Manacher
- Suffix arrays & Rabin–Karp
- DFT/NTT & generating functions
- Möbius inversion & game theory
- Mo’s algorithm & parallel binary search
Full materials: not yet published; no release date has been announced. Use the mapped syllabus with the interim practice collections below.
- Choose one advanced topic cluster from the map.
- Study a trusted reference and implement the technique.
- Solve three progressively harder mapped problems.
- Validate retention in a timed virtual contest.
WORLD FINALS
Course IV
Study the specialized structures and string techniques that distinguish the deepest problems on the world stage.
- Link-cut trees & treaps
- Suffix automata & suffix trees
- Lyndon factorization & Z-function
- Matching
- Minkowski sum
- Alien trick
Full materials: not yet published; no release date has been announced. Use this expert map after Course III mastery and pair it with the interim practice collections.
- Confirm Course III fluency before selecting an expert topic.
- Study the official map alongside KACTL and advanced references.
- Implement and stress-test the technique locally.
- Apply it to official World Finals archive problems.
FROM TOPIC TO MASTERY
Don’t stop at understanding.
The mapped Problem Library now includes 72 attributed tasks. Use it for a deliberate sequence, then broaden practice through the reviewed collection index.
CATEGORIZED PRACTICE
CSES Problem Set
Build fluency across core algorithmic categories. ↗CURATED PROBLEMS
Methods to Solve
Find high-quality problems organized by topic. ↗REFERENCE + PRACTICE
Competitive Programming 4
Connect techniques with a proven training framework. ↗OPEN HANDBOOK
Competitive Programmer’s Handbook
Review core algorithms in a concise, free reference. ↗CHOOSE YOUR NEXT MOVE
A path for every role.
Student
Start with Course I, pair every topic with practice, then enter virtual or live contests.
Explore learning resources →Coach
Use the four-course map to plan a season, diagnose gaps, and choose focused team sessions.
Find training camps →Educator
Adapt Course I materials for the classroom and use the advanced syllabus to extend your sequence.
Request curriculum materials ↗