Loading
Core Programming · Sorting & Searching · Mathematics for CP · Stacks, Queues, Heaps & Hashing · Greedy Algorithms
Sharpen your algorithmic thinking, data structures, and competitive programming skills for IOI and national coding rounds.
The Informatics ladder, level by level — what each round looks like, when it happens, and what to study.
14 resources · 6 papers
8 resources · 9 papers
9 resources · 9 papers
Nepal is not yet an IOI member and has never participated — verified against the official 118-country member list (stats.ioinformatics.org). NOI names its Top 4 the 'IOI Nepal Team' and runs a C++ training camp for them, but IOI accreditation is the missing step. Every other South Asian country (India, Pakistan, Bangladesh, Sri Lanka) is a member.
0 resources · 0 papers
Facts verified from 2 published sources · last updated 2026-10-24
Which exam are you sitting?
Showing 30 of 30 resources · 19 of 19 papers
Curated resources for Informatics.
Mathematics for Computer Science
"You can focus only on materials from Week 0–5"
"mainly useful for visualizing the concepts you've learned… especially since they can sometimes feel abstract"
403 to scripts
"a comprehensive list of the most commonly used data structures and algorithms, along with tutorials, implementations, and related problems… essential to bookmark"
"style guides you can follow to write correct, fast, clear and consistent code"
May return 403 to automated checks; open in a browser
403 to scripts (bot-wall); opens normally in a browser
"a detailed side-by-side reference sheet for common syntaxes"
"semi-permanent pages for code sharing… especially useful when you need someone else to review your code"
"a clear and approachable introduction… an excellent starting point compared to more formal texts"
NPLCoder's own #2 recommendation: "This highly recommended beginner book for competitive programming covers various essential concepts, making it an excellent starting point for newcomers." Free 300-page PDF, and it is the official companion text to the CSES problem set (P4).
The canonical free algorithm reference — every Round-2 and Round-3 topic with working C++ implementations and complexity proofs. Not in NPLCoder's list; an addition by this document.
NPLCoder: "A list of important topics in competitive programming with exercise problems." A ready-made topic→problem map.
The most-shared CP advice post
May return 403 to automated checks; open in a browser
Curated tutorials
May return 403 to automated checks; open in a browser
May return 403 to automated checks; open in a browser
NPLCoder: "comprehensive lecture slides and a short set of exercises, introducing you to programming contests. It also revisits key concepts… showing how to apply them effectively in competitive programming."
Training methodology
May return 403 to automated checks; open in a browser
The canonical free algorithm reference — every Round-2 and Round-3 topic with working C++ implementations and complexity proofs. Not in NPLCoder's list; an addition by this document.
Curated by the IOI itself
NPLCoder: "A timeless classic… a systematic approach to solving problems creatively."
NPLCoder: "a solid option… rigorous definitions and proofs… otherwise you can safely skip it."
NPLCoder: "written in a more readable style, and many find it more comprehensive… valuable resources, including the author's video lectures, can be accessed on its official website."
NPLCoder: "often considered the 'bible' of algorithms and data structures… an in-depth and rigorous exploration."
NPLCoder: "Everything you need to know about floating point numbers. A must read especially for geometry topics" — directly serves Round 4's computational geometry
403 to scripts (WordPress bot-wall); opens in a browser
NPLCoder: "A comprehensive guide to preparing for the ACM-ICPC" — useful for the team-competition format
NPLCoder: "well-organized, featuring detailed explanations and excellent illustrations. It is even used as a textbook in some IOI training camps."
Real competition papers, grouped by round and year. Print one and sit it like the real exam.
403 to scripts; works in a browser
403 to scripts; works in a browser
403 to scripts; works in a browser
same
A HackerRank account may be required to access practice problems
403 to scripts
What is examined in the Informatics Olympiad, round by round. Tick items as you revise, or print this page as a checklist (ticks are not saved).
Draft taxonomy — official transcription in progress
Several of these are taught extensively in NEB and even required by other Nepali olympiads (e.g. trigonometry for Astronomy). They count for nothing at the IOI.
Source: Official IOI Syllabus 2025 — 85 excluded topics (via informatics research file, I-5) ↗
Once you've grabbed the materials, explore how the topics connect and chart your preparation.
Every official Informatics topic, placed on the round that examines it first.
Pick a topic to filter the study materials and past papers down to just that area.
NOI Round 1: I/O, variables, conditionals, loops, primitive types, arrays, strings, brute force and simulation.
Standard library sorting (Round 1) and binary search on sorted data (Round 2).
Arithmetic, primes, GCD/LCM (Round 1); modular arithmetic and basic combinatorics (Round 2).
NOI Round 2: stacks, queues, lists and linked lists, heaps (priority queues), basic hashing.
NOI Round 2.
NOI Round 2: graph representation (adjacency list/matrix), breadth-first and depth-first search.
⚠ No Nepali material — self-study required
Round 2: simple 1-D cases. Round 3: 2-D and grid DP. Round 4: bitmask DP and DP on trees.
⚠ No Nepali material — self-study required
NOI Round 3.
⚠ No Nepali material — self-study required
Round 3: DSU, segment trees, Fenwick trees, tries. Round 4: balanced BSTs.
⚠ No Nepali material — self-study required
Round 3: shortest paths (Dijkstra, Bellman-Ford, Floyd-Warshall) and MST (Kruskal, Prim). Round 4: combinations of advanced graph algorithms.
⚠ No Nepali material — self-study required
Round 3: tries. Round 4: KMP string matching.
⚠ No Nepali material — self-study required
NOI Round 4: basic computational geometry concepts.
⚠ No Nepali material — self-study required
NOI Round 3: proof techniques and the inclusion-exclusion principle.
A representative problem from Informatics.
Featured problem coming soon
We verify every statement against an official source before it appears here. No fabricated problems ship to production.
Draft stages — real dates and actions are being transcribed from the official notices.
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
Official contacts for the Informatics Olympiad, and the content gaps we are working to fill.
National organiser — NOI, NPLAlgo, NPLIMO, AIMS
IOI Syllabus maintainer — IOI accreditation questions
National olympiad recognition (कार्यविधि २०८२)
Cross-subject partner — NPLIMO overlaps with MAN's IMO pipeline
Nepal is not an IOI member — the NOI pipeline has no exit (every other South Asian country is a member)
NOI registration deadline published inconsistently; the whole schedule is email-gated
No NOI past papers exist (first iteration) — students cannot calibrate at any round
AIMS 2026 stops short of NOI Rounds 3–4 (no segment trees, DSU, Fenwick, shortest paths, MST, tries, bitmask DP, KMP, geometry)
No 'what NOT to study' guide — the IOI excludes calculus, trig, complex numbers, statistics and conics, all taught heavily in NEB
No Nepali-language introductory competitive-programming material
NPLCoder's official Resources document has 2 dead links, a wrong email TLD (.edu) and two different Discord invites
No published centre list or district-coverage data for the NOI
No documented IOI Training Camp curriculum (C++-only, top 4)
No calibrated difficulty ladder tied to public ratings
Topic tree should follow the NOI's four cumulative rounds + IOI category overlay
NPLAlgo's weekly/monthly contests are not publicly archived
Pick a topic, follow the constellation, and start building toward the Informatics national round.