Skip to content

Book Coverage Roadmap

  • Purpose: source-driven roadmap for remaining algorithm and data-structure coverage after the core repo has already become broad
  • Scope: gaps and under-covered neighbors surfaced by major books and PDFs, especially when they are not yet full lanes in the repo
  • Doc type: planning
  • Owner: repo maintainer
  • Status: active
  • Last reviewed: 2026-04-25
  • Update triggers: after any broad book/PDF audit, after any major reprioritization, or when one of the listed source-driven waves ships
  • Canonical companion docs: Roadmap, Expansion Roadmap, Algorithm Gap Roadmap, Freshness Backbone, Source Map

This file exists so the repo can answer a different question than the normal expansion backlog:

  • not just "what sounds cool next?"
  • but "after checking the major CP books and algorithm texts, what is still missing, thin, or only present as a boundary note?"

The goal is breadth without drift:

  • keep the repo aligned with the strongest contest-facing books
  • notice textbook-breadth topics that are still worth having
  • explicitly mark low-ROI topics so they do not keep resurfacing as accidental TODOs

Shipped since this audit was first drafted:

  • [x] Tree Isomorphism on 2026-04-25
  • [x] de Bruijn Sequence / de Bruijn Graph Modeling on 2026-04-25
  • [x] Bit-Parallelism / Bitset Optimization on 2026-04-25
  • [x] Hungarian / Assignment Problem on 2026-04-25
  • [x] Edmonds Blossom / General Matching on 2026-04-25
  • [x] Randomized / Global Min-Cut on 2026-04-25
  • [x] Burnside / Pólya / Group Actions on 2026-04-25
  • [x] Berlekamp-Massey / Kitamasa on 2026-04-25
  • [x] FWHT / XOR Convolution / Subset Convolution on 2026-04-25
  • [x] Interval Trees on 2026-04-25
  • [x] B-Trees on 2026-04-25
  • [x] Skip Lists on 2026-04-25
  • [x] X-Fast / Y-Fast Tries on 2026-04-25
  • [x] Regular Expressions / Finite Automata on 2026-04-25
  • [x] Huffman / Data Compression on 2026-04-25
  • [x] Online Algorithms on 2026-04-25
  • [x] Machine Learning Algorithms on 2026-04-25
  • [x] Gradient Descent on 2026-04-25
  • [x] Quantum Algorithms on 2026-04-25
  • [x] Parallel Algorithms on 2026-04-25

Source Set Reviewed

This roadmap is based on the following public source pages and PDFs checked on 2026-04-25.

Source Kind Why it matters here
Competitive Programmer's Handbook free CP PDF baseline CP canon and classic CSES-flavored topic mix
Guide to Competitive Programming, 3rd ed. (2024) current CP textbook newer advanced-CP synthesis, including explicitly modern topics
Competitive Programming 4 contents CP book companion site rare-topic radar and practice-heavy classification
Introduction to Algorithms, 4th ed. and its table of contents PDF flagship algorithms textbook broad reference for classical algorithms and newer textbook additions
Algorithms by Jeff Erickson free modern algorithms textbook + advanced notes excellent signal for theory-heavy topics that still have practical algorithmic value
Dasgupta, Papadimitriou, Vazirani and TOC PDF free algorithms textbook compact core + theory-side neighboring topics
Open Data Structures free data-structures textbook best signal for textbook DS families not always hand-coded in CP
Algorithms, 4th ed. by Sedgewick and Wayne practical algorithms text strong breadth signal for data structures, strings, regex, compression, and B-trees
The Algorithm Design Manual practical design text reinforces design-technique breadth, search, DP, weighted graphs, hard problems

Current Repo Synthesis

The repo is already strong on most CP canon:

So this roadmap is no longer about filling beginner gaps.

It is about:

  • promoting boundary mentions into real lanes when the topic still matters
  • adding textbook-breadth topics only when they justify their surface area
  • keeping the queue explicit enough that no serious source-backed family is forgotten

How To Read Priority

High

  • appears across multiple checked sources
  • or is already a strong boundary inside the repo that now deserves a full lane
  • or unlocks multiple neighboring topics

Medium

  • source-backed and worthwhile
  • but may fit better as a micro-lane, refinement, or sibling under an existing family

Low

  • useful for breadth or theory
  • but not strong enough to jump ahead of CP-first lanes

Source-By-Source Gap Matrix

This is the anti-forgetting section: one pass per source family, with the remaining uncovered or thinly covered items called out directly.

Competitive Programmer's Handbook

Status:

  • most of the core handbook is already covered strongly
  • the remaining under-covered neighbors are mostly advanced side roads rather than mainline canon

Still worth extracting more explicitly:

Guide to Competitive Programming (2024)

Status:

  • the repo already matches a large fraction of the advanced CP-oriented coverage
  • the clearest remaining gap from the book's newer advanced framing is not another tree/data-structure lane, but implementation-driven technique lanes

Still worth extracting more explicitly:

Competitive Programming 4

Status:

  • the repo has already shipped many topics CP4 treats as rare: HLD, Li Chao, Lucas, CRT, centroid, Mo, FFT, simplex, matroid intersection, game theory, and more
  • CP4 is still the strongest signal for a few remaining contest-rare leaves

Still worth extracting more explicitly:

CLRS 4th Edition

Status:

  • the repo already covers much of the CP-relevant overlap: BSTs, red-black context, DSU, DP, flow, bipartite matching, FFT, number theory, suffix arrays, simplex, LP duality, approximation, and hardness
  • the remaining CLRS-shaped gaps are classical but not all equally contest-relevant

Still worth extracting more explicitly:

  • Hungarian / assignment problem
  • status: now shipped as Hungarian / Assignment Problem
  • Stable Marriage
  • status: now shipped as Stable Marriage
  • Interval Trees
  • status: now shipped as Interval Trees
  • note: intentionally shipped as a narrow textbook-breadth lane, not as a first-line replacement for the repo's main ordered-set or segment-tree routes
  • B-Trees
  • status: now shipped as B-Trees
  • note: intentionally shipped as a textbook-breadth lane, not as a contest-first ordered-set route
  • Online Algorithms
  • status: now shipped as Online Algorithms
  • note: intentionally kept as a narrow theory-breadth lane with deterministic ski rental as the exact first route
  • Machine Learning Algorithms
  • status: now shipped as Machine Learning Algorithms
  • note: intentionally kept as a narrow breadth lane around perceptron on linearly separable data, not a general ML curriculum

Jeff Erickson

Status:

  • the repo already covers several advanced-note families he highlights: min-cost flow, LP, simplex, matroids, randomized algorithms, suffix structures, DSU, treaps, scapegoat/splay context
  • the clearest remaining signal is around min-cut and a few textbook-breadth side topics

Still worth extracting more explicitly:

Dasgupta, Papadimitriou, Vazirani

Status:

  • the core divide-and-conquer, graph, greedy, DP, LP, and hardness layers are already well represented in the repo
  • the meaningful remaining gap from this book is mostly not CP-first

Still worth tracking:

  • Quantum algorithms
  • status: now shipped as Quantum Algorithms
  • note: intentionally kept as a narrow theory-breadth lane around a classical simulator for the Deutsch-Jozsa promise problem

Open Data Structures

Status:

  • this source mostly reinforces that the repo already covers the CP-relevant BST and meldable-heap families well
  • what remains here is mostly textbook data-structure breadth

Still worth extracting more explicitly:

Recommended treatment:

  • do not prioritize them ahead of stronger contest-facing gaps
  • if opened at all, treat them as a textbook breadth wave, not a CP-core wave

Sedgewick and Wayne

Status:

  • many core families are already covered: graphs, strings, suffix arrays, searching, balanced BSTs, flow
  • the clearest remaining signals are breadth topics rather than urgent CP gaps

Still worth extracting more explicitly:

  • B-Trees

Recommended treatment:

The Algorithm Design Manual

Status:

  • this source mostly confirms that the repo is already strong on design paradigms, weighted graphs, combinatorial search, DP, and hardness
  • it is more of a sanity check than a strong source of new lane obligations at this stage

Remaining value:

  • use it to validate sequencing and representative problem choice
  • do not open standalone lanes only because this book mentions them

Full-Lane Candidates Still Worth Shipping

At the moment, this queue is empty.

The last remaining full-lane gap from the current book sweep has now shipped:

Micro-Lane Or In-Family Refinement Candidates

These are real topics, but they should usually ship as sibling pages or refinements inside an existing family.

Topic Best home Why not a top-priority standalone wave
Push-Relabel under Maximum Flow refinement of a family the repo already teaches well
Regular Expressions / finite automata now shipped as Regular Expressions / Finite Automata breadth-motivated string micro-lane, not a contest-core replacement for literal matchers
Huffman / Data Compression now shipped as Huffman / Data Compression breadth-motivated greedy micro-lane, not a contest-core replacement for mainstream string tooling
Online Algorithms now shipped as Online Algorithms theory-breadth lane kept intentionally narrow around deterministic ski rental and competitive analysis

Compare-Note / Breadth-Only Candidates

These should stay behind the contest-facing queue unless the repo explicitly decides to broaden into textbook coverage for its own sake.

Topic Main supporting source Recommended treatment
Skip List ODS, Jeff Erickson now shipped as a narrow textbook-breadth lane
x-fast trie / y-fast trie ODS now shipped as a narrow textbook-breadth lane
Machine Learning Algorithms CLRS 4e now shipped as a narrow breadth lane Machine Learning Algorithms
Quantum Algorithms Dasgupta et al. now shipped as a narrow breadth lane Quantum Algorithms
Parallel Algorithms CLRS 4e now shipped as a narrow breadth lane Parallel Algorithms
Gradient Descent CLRS 4e, CP4 mention now shipped as a narrow breadth lane Gradient Descent

Suggested Default Ship Order

This queue tries to maximize:

  • contest relevance
  • fit with existing repo boundaries
  • source coverage breadth
  • teaching coherence

Wave A. Cut-Tree / Cut-Family Completion

Wave B. Bitwise Algebra / Packed-State Techniques

  • all currently identified book-backed gaps in this bucket are now shipped

Wave C. Rare Modeling Leaves

  • all currently identified rare modeling leaves are now shipped

Wave D. Matching / Flow Refinement Extras

  • now closed: Push-Relabel has shipped as an in-family refinement under Maximum Flow

Wave F. Textbook Breadth, Only If Wanted

  • all currently identified textbook-breadth data-structure gaps in this bucket are now shipped

Wave G. Theory-Breadth Extras

Wave H. Out-Of-Scope Unless The Repo Intentionally Broadens

  • none currently

"Do Not Forget" Checklist

Use this checklist before declaring the post-core repo "book-broad enough."

Must Still Decide Explicitly

  • [x] Hungarian / Assignment Problem
  • [x] Edmonds Blossom / General Matching
  • [x] Gomory-Hu Tree
  • [x] Burnside / Pólya / Group Actions
  • [x] Berlekamp-Massey / Kitamasa
  • [x] FWHT / XOR Convolution / Subset Convolution
  • [x] Bit-Parallelism / Bitset Optimization

Should Eventually Resolve One Way Or The Other

  • [x] Tree Isomorphism
  • [x] de Bruijn Sequence
  • [x] Stable Marriage
  • [x] Randomized / Global Min-Cut
  • [x] Push-Relabel
  • [x] Interval Trees

Low-Priority But Should Not Reappear As "Forgotten"

  • [x] B-Trees
  • [x] Skip Lists
  • [x] x-fast / y-fast tries
  • [x] Regular Expressions / finite automata
  • [x] Huffman / Data Compression
  • [x] Online Algorithms
  • [x] Machine Learning Algorithms
  • [x] Gradient Descent
  • [x] Quantum Algorithms
  • [x] Parallel Algorithms

Definition Of Done For One Book-Driven Gap

A topic in this file is not considered resolved just because it appears in an index or as one problem note.

It is resolved only when one of the following is true:

  • it becomes a full lane with topic page, starter, hot sheet, ladder route, flagship note, and routing
  • it becomes a consciously documented micro-lane or compare-note under the right parent family
  • it is consciously marked out of scope with a brief reason in this file or the main roadmap

Relationship To The Other Roadmaps

So the normal workflow should be:

  1. audit large sources into this file
  2. promote the best actionable items into Algorithm Gap Roadmap or a new wave plan
  3. ship them in small waves
  4. return here after the next broad audit