Concepts
- 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
- Computational Geometry
- Strongly connected components
- Articulation points
- Dynamic programming on trees
- Algorithmic Games
- Maximum Bipartite Matching O(VE) algorithm
- Tries
Problems (with hints):
- IOI problems
- Pyramid (IOI 2006)
- Fish (IOI 2008)
- Scales (IOI 2015)
- Boxes with Souvenirs (IOI 2015)
- Problems from training camps (India, China, Canada)
- Pipe Marbles (NOI 2009: China)
- Register report (IOI Training Camp 2012: India)
- Zorgian Amusement Park (IOI Training Camp 2010: India)
- Catering Contracts: Version 2π (IOI Training Camp 2008: India)
- Binary Codes (IOI Training Camp India: 2010)
- Election Night (CCC01 Stage 2: Canada)
- Parade (CCC09 Stage 2: Canada)
- Circle of Life (CCC 2016: Canada)
Problems (without hints):
- Bull in a China Shop (Platinum, US Open 2016: USA)
- 262144 (Platinum, US Open 2016: USA)
- Landscaping (Platinum, US Open 2016: USA)
More practice problems:
- Advanced channel of ICO Online Judge community (more advanced problems)
- Beginner concepts and problems (this community)
- Intermediate concepts and problems (this community)
Last updated: 24th January, 2017
