Codeforces: Hard Problem Solving6 sections · 233 units
Open in Course

What You'll Learn

The sections ahead

You'll work through 55 sections, each focused on a different competitive programming pattern:

1.1. Dynamic Programming for bitmask, digit, interval, and tree DP

2.2. Segment Trees and BIT for range queries and lazy propagation

3.3. Graphs and Trees for bridges, shortest paths, LCA, and tree DP

4.4. Number Theory for Euler totient, CRT, and prime factorization

5.5. Constructive Algorithms for parity arguments and reverse simulation

Each section starts with the pattern, then gives you 1010 problems. You should first try to solve them yourself on Codeforces, and then look at the step by step solution that I explain.