Note: There is no official syllabus for ZCO vs INOI vs IOITC. Syllabus for ZCO, INOI has been determined by looking at all the concepts covered in all ZCO, INOI problems since last 5 years. All the topics covered by ZCO, INOI are also in the Basic topics section of ICO online study material. Syllabus for IOITC is same as syllabus for IOI, since the training camp is training you for IOI. There is a higher focus on the topics mentioned in the Advanced topics specifically covered in ICO online study material. :)

The below tutorials are the best tutorials on the internet for each topic. If you find better tutorials for a particular topic, please share them with everyone.

Zonal Computing Olympiad (ZCO):

• Episode 1: Why do we need (efficient) algorithms?
• Episode 2: Our first algorithm: Quick-sort
• Episode 3: Merge-sort
• Episode 4: Binary search
• Episode 5: Binary search extended
• Episode 6: Dynamic Programming
• Episode 7: Dynamic Programming (contd.)
• Episode 8: Introduction to graphs (only "Reachability in a grid")

Indian National Olympiad in Informatics (INOI):

• Introduction to Graphs (and how to represent them)
• Standard Template Library (and adjacency list implementation)
• Breadth-first search and Depth-first search
• Heap and Heap Sort
• Single-source shortest-paths
• Doubts regarding Dijkstra's Algorithm
• All-pairs shortest-paths

International Olympiad in Informatics Training Camp (IOITC):

• Minimum Spanning Tree (Prim's algorithm and Kruskal's algorithm)
• Correctness of Prim's algorithm and Kruskal's algorithm
• Segment Trees and Binary Indexed Trees
• Strongly connected components
• Articulation points
• Dynamic programming on trees
• Algorithmic Games
• Maximum Bipartite Matching O(VE) algorithm
• Tries
• Computational Geometry

Happy coding!