Newbie to Pupil (CF)
Structured path to reach Codeforces Pupil (1200+). Master basics: implementation, brute force, greedy, and simple data structures
Pupil to Specialist (CF)
Advance from Pupil to Specialist (1400+). Master binary search, two pointers, basic DP, and graph fundamentals
Specialist to Expert (CF)
Reach Expert level (1600+). Advanced DP, segment trees, number theory, and complex graph algorithms
Expert to Candidate Master (CF)
Push to Candidate Master (1900+). Master advanced algorithms, competitive tricks, and speed optimization techniques
AtCoder Rating Booster
Specialized training for AtCoder contests. Master AtCoder-style problems and improve your rating systematically
CP Fundamentals
Master the basics of competitive programming including time complexity, basic data structures, and problem-solving techniques
ICPC Regional Preparation
Advanced algorithms and data structures needed for ICPC regional competitions including graphs, DP, and number theory
ICPC World Finals
Master advanced techniques for ICPC World Finals: advanced DP, computational geometry, string algorithms, and more
IOI Foundations
Essential topics for IOI: sorting, searching, basic graph algorithms, and greedy approaches
IOI Gold & Platinum
Advanced algorithms for IOI medals: segment trees, advanced DP, flows, and computational geometry
FAANG Interview Prep
Prepare for technical interviews at top tech companies with curated problems and patterns
Data Structures Mastery
Deep dive into essential data structures: arrays, linked lists, stacks, queues, trees, and hash tables
Graph Algorithms Deep Dive
Comprehensive coverage of graph algorithms: BFS, DFS, shortest paths, MST, flows, and more