Core Learning

Olympiad

Explore dedicated competition tracks in mathematics, programming, and cybersecurity, and master problem-solving strategies with preparation blogs.

4Olympiads
8Prep blogs
20+Worked problems
Math · Programming · Cyber Security · PhysicsDisciplines

Competition Disciplines

Olympiad Tracks

Specialized competition tracks designed to build rigorous mathematical reasoning, algorithmic mastery, and systems security acumen.

Explore Math Olympiad
Coming Soon

Math Olympiad

Proof techniques, combinatorics & number theory

Train for advanced problem solving, proofs, number theory, algebra, and geometry challenges.

  • Number Theory
  • Combinatorics
  • Geometry
  • Algebra
Explore track
Explore Programming Olympiad
Coming Soon

Programming Olympiad

Algorithms, data structures & contest coding

Sharpen algorithms, data structures, and contest coding strategies for elite competition rounds.

  • Algorithms
  • Data Structures
  • Graph Theory
  • Dynamic Programming
Explore track
Explore Cyber Security Olympiad
Coming Soon

Cyber Security Olympiad

System defense, cryptography & security challenges

Explore secure systems, logical attack-defense thinking, and modern cyber challenge preparation.

  • Cryptography
  • Network Security
  • Reverse Engineering
  • Forensics
Explore track
Explore Physics Olympiad
Coming Soon

Physics Olympiad

Classical mechanics, electromagnetism & thermodynamics

Master fundamental physical laws, analytical modeling, and competition-level physics problem solving.

  • Classical Mechanics
  • Electromagnetism
  • Thermodynamics
  • Wave Optics
Explore track

Preparation Guides

Olympiad Preparation Blogs

One long-form guide in the spotlight — the archive keeps every earlier guide one scroll away.

All 8 guides
Latest
CombinatoricsFoundation7 min read

The Pigeonhole Principle: Your First Move on Most Olympiad ProblemsThe Pigeonhole Principle: Your First Move on Most Olympiad Problems

If n+1 pigeons sleep in n holes, one hole is crowded — and that single sentence wins a shocking number of olympiad problems. Here is how to spot the pigeons hidden inside a statement.

  • Restate every problem as "objects" and "boxes" before doing anything else
  • The hard part is choosing the boxes — the counting is usually one line
  • Extended form: with n boxes, some box holds at least ceil(total / n) objects
  • Works on sums, remainders, distances and dates, not just literal holes

Olympiad Desk · Core Learning

Read the guide

Older guides

7 guides
Browse the full archive →