SPOJ Training Path

Phase	Main Topic	Practice Problems	Goal
1	Ad-Hoc Problems (Getting Started)	TEST - Life, the Universe, and Everything ADDREV - Adding Reversed Numbers FCTRL2 - Small factorials ONP - Transform the Expression PALIN - The Next Palindrome	Get familiar with the judging system and basic problems.
2	Math	Number Theory: PRIME1 - Prime Generator FCTRL - Factorial TDPRIMES - Printing some primes DIVSUM - Divisor Summation Combinatorics: NSTEPS - Number Steps PERMUT2 - Ambiguous Permutations	Apply mathematical concepts to solve problems.
3	Binary Search	AGGRCOW - Aggressive cows PIE - Pie BSEARCH - Binary search EKO - Eko	Master the binary search on the answer technique.
4	Data Structures & C++ STL	Standard Template Library (STL): STPAR - Street Parade JNEXT - Just Next !!! ANARC09A - Seinfeld Advanced Data Structures: GSS1 - Can you answer these queries I HORRIBLE - Horrible Queries	Efficiently use the standard library and complex data structures.
5	Graph Traversal (DFS/BFS)	PT07Z - Longest path in a tree BUGLIFE - A Bug’s Life LABYR1 - Labyrinth MICEMAZE - Mice and Maze	Master basic graph traversal algorithms.
6	Disjoint Set Union (DSU)	FRNDCIRC - FRIEND CIRCLE KOZE - Sheeps CLSLNS - Close Cousins	Understand and apply DSU for set-related problems.
7	Backtracking	NQUEEN - N-Queens Puzzle SUDOKU - Sudoku TULIPS - Tulips and Roses	Solve global search problems using backtracking.