Roadmap

At the end of this roadmap, you'll fully know what a Centroid is, how to build a Centroid Tree, and how to use this Divide and Conquer technique to solve hard path problems on trees efficiently.

At the end of this roadmap, you'll fully know the fundamental principles of counting, how to distinguish between permutations and combinations, and how to solve problems involving grids, partitions, and modular arithmetic.

At the end of this roadmap, you'll fully know the basics of C++, how to work with variables, conditions, loops, and arrays, and how to solve your first competitive programming problems.

At the end of this roadmap, you'll fully know what a graph is, how to store it in memory, how to traverse it, and how to solve classic connectivity problems on both standard graphs and grids.

At the end of this roadmap, you'll fully know what DP is and you are ready to solve problems from it.