Want to climb rating fast? Here’s the simplest 10-topic roadmap that actually works:↵
↵
- Basic Programming (Fast I/O, loops, vectors, strings)↵
- Greedy↵
- Binary Search↵
- Two Pointers↵
- Sorting + Simple Math (GCD, modulo)↵
- Prefix Sums / Difference Arrays↵
- Basic 1D DP↵
- Graphs – BFS + DFS↵
- Number Theory (Sieve, primes, modular inverse)↵
- Basic Data Structures (Stack, Queue, Set, Map, Priority Queue)↵
↵
Fastest Practice Plan:↵
↵
- 1 topic per week↵
- Solve only 800–1200 rated problems↵
- Focus on Div.2 A → B → C (then D)↵
↵
Start here:↵
https://codeforces.me/problemset?tags=800-1200&order=problem_rating_ASC↵
Follow this and you can go Newbie → Pupil → Specialist → Expert in just 3–6 months!
↵
- Basic Programming (Fast I/O, loops, vectors, strings)↵
- Greedy↵
- Binary Search↵
- Two Pointers↵
- Sorting + Simple Math (GCD, modulo)↵
- Prefix Sums / Difference Arrays↵
- Basic 1D DP↵
- Graphs – BFS + DFS↵
- Number Theory (Sieve, primes, modular inverse)↵
- Basic Data Structures (Stack, Queue, Set, Map, Priority Queue)↵
↵
Fastest Practice Plan:↵
↵
- 1 topic per week↵
- Solve only 800–1200 rated problems↵
- Focus on Div.2 A → B → C (then D)↵
↵
Start here:↵
https://codeforces.me/problemset?tags=800-1200&order=problem_rating_ASC↵
Follow this and you can go Newbie → Pupil → Specialist → Expert in just 3–6 months!
