Practice with Codeforces Roadmap

Phase	Main Topic / Rating	Content	Goal
1	Foundations	Choose Programming Language (C++) Big O Notation Set Up Environment	Establish fundamental programming and environment setup skills.
2	Newbie (Rating < 1200)	Basic Math & Number Theory Brute Force Technique Sorting & Greedy Using Basic Data Structures	Master basic problem-solving techniques and data structures.
3	Pupil (Rating 1200-1400)	Binary Search Two Pointers Technique DFS & BFS Modulo Arithmetic	Learn standard algorithms for common problem types.
4	Specialist (Rating 1400-1600)	Basic Dynamic Programming (DP) Advanced Graph (Dijkstra, MST) Tree Data Structures (BST, Heap) Query Processing (Prefix Sums)	Tackle intermediate topics like DP and graph algorithms.
5	Expert (Rating 1600-1900)	Advanced Dynamic Programming Segment Tree & Fenwick Tree Max Flow Game Theory	Master advanced data structures and algorithmic paradigms.
6	Candidate Master & Above (Rating 1900+)	Advanced String Algorithms Computational Geometry FFT & Polynomial Multiplication Intensive Practice	Explore specialized topics and achieve high-level proficiency through practice.

1

Foundations

Establish fundamental programming and environment setup skills.

2

Newbie (Rating < 1200)

Master basic problem-solving techniques and data structures.

3

Pupil (Rating 1200-1400)

Learn standard algorithms for common problem types.

4

Specialist (Rating 1400-1600)

Tackle intermediate topics like DP and graph algorithms.

5

Expert (Rating 1600-1900)

Master advanced data structures and algorithmic paradigms.

6

Candidate Master & Above (Rating 1900+)

Explore specialized topics and achieve high-level proficiency through practice.