Competitive Programming Learning Path (CSES)

Phase	Main Topic	Problem List	Goal
1	Introductory Problems	Weird Algorithm Missing Number Repetitions Increasing Array Permutations	Master basic programming concepts and I/O handling.
2	Sorting and Searching	Distinct Numbers Ferris Wheel Concert Tickets Sum of Two Values	Effectively apply sorting and binary search algorithms.
3	Dynamic Programming	Dice Combinations Minimizing Coins Removing Digits Grid Paths	Solve optimization problems by breaking them into subproblems.
4	Graph Algorithms	Building Roads Message Route Building Teams	Master graph traversal and pathfinding algorithms.
5	Range Queries	Static Range Sum Dynamic Range Sum Range Minimum Queries	Use data structures like segment trees to handle queries efficiently.
6	Tree Algorithms	Subordinates Tree Diameter Tree Distances I Company Queries I	Apply algorithms on tree data structures.
7	Mathematics	Common Divisors Counting Divisors Creating Strings	Solve problems related to number theory and combinatorics.