You'll work through sections, each focused on a different competitive programming pattern:
Dynamic Programming for bitmask, digit, interval, and tree DP
Segment Trees and BIT for range queries and lazy propagation
Graphs and Trees for bridges, shortest paths, LCA, and tree DP
Number Theory for Euler totient, CRT, and prime factorization
Constructive Algorithms for parity arguments and reverse simulation
Each section starts with the pattern, then gives you problems. You should first try to solve them yourself on Codeforces, and then look at the step by step solution that I explain.