- Arrays
- Trees
- Heaps
- Hash maps
Loading
Loading
Data Structures · Algorithms · Graph Theory · Dynamic Programming
Sharpen your algorithmic thinking, data structures, and competitive programming skills for IOI and national coding rounds.
Curated resources for Informatics.
Your library is quiet for now
Study materials will appear here as the Olympiad library grows.
Timed, competition-format papers. Treat each one like the real round.
No papers published yet
Model question papers will appear here as they are released.
The official topic areas for the Informatics Olympiad.
Once you've grabbed the materials, explore how the topics connect and chart your preparation.
Click any node to focus that topic — the library and papers will follow.
Select a topic to focus its materials, or start it to track progress.
A representative problem from Informatics.
Give the time complexity of merge sort and justify it from its recurrence.
Five stages from first principles to competition day.
Build core concepts from your school syllabus before touching Olympiad-level problems. Focus on accuracy over speed.
Outcome — Confident with fundamentals
Work through Olympiad problems by topic. Start recognising the patterns that sit behind the problems.
Outcome — Topic-level fluency
Tackle multi-concept and proof-based problems. Develop rigorous, competition-grade arguments.
Outcome — Solves hard problems
Attempt full-length past papers under real timing. Build stamina and exam temperament.
Outcome — Exam-ready speed
Final refinement. Light practice, weak-area review, and peak taper before the national round.
Outcome — Compete at nationals
Pick a topic, follow the constellation, and start building toward the Informatics national round.