Writing

Competitive Programming:
Beyond the Basics

A book for programmers who know the fundamentals and want to solve unfamiliar problems.

Twenty chapters · classroom edition active · September 2026

Contest problems do not arrive with algorithm labels. This book, written with Josh Alman, is about the judgment between knowing standard tools and using them under pressure.

Public roadmap

20 chapters in the working manuscript
  1. Reading constraints as design information
  2. Representations that make structure visible
  3. Invariants, exchange arguments, and proof habits
  4. Dynamic programming as state design
  5. Graph problems beyond named algorithms
  6. Data structures as maintained promises
  7. From idea to implementation
  8. Testing, debugging, and adversarial thinking
  9. Upsolving and post-contest review
  10. Building a practice plan that transfers

This public roadmap groups the manuscript’s twenty working chapters into ten themes. The full manuscript remains private while it is being tested and edited.

A preview of the approach

Working principle

Do not ask only, “Which algorithm is this?”

Ask what information must survive from one decision to the next, what cannot change in an optimal solution, and which representation makes those facts easiest to express. Named algorithms become more useful when they are consequences of the structure you found, not guesses made from surface resemblance.

Read a representative public excerpt →