Graph Algorithms (S4)

Dijkstra and weighted shortest paths Minimum spanning trees Topological sort and DAGs Strongly connected components DSU applications and offline processing

Trees

Tree DP and rerooting LCA and binary lifting

Dynamic Programming

1D DP and state design The knapsack family Grid and interval DP DP on DAGs and shortest-path-as-DP DP over sequences and subsequences DP optimization (CHT, D&C, monotone)DP with geometry/counting states

Number Theory and Combinatorics

Modular exponentiation, inverses, sieves Binomial coefficients and counting mod p

Geometry II

Convex hull and orientation Sweep line and geometric counting

Data Structures II

BIT and segment trees

Graph Algorithms (S4)

Minimum spanning trees

common

Work in progress

This module is still being written — the content here is a placeholder. This guide is open source, and contributions are welcome.

Contribute on GitHub — help write this module by opening a pull request.

Dijkstra and weighted shortest paths

Dijkstra and weighted shortest paths — anchored on 2021 S4 *Daily Commute* and 2025 S4 *Floor is Lava*

Topological sort and DAGs

Topological sort and DAGs — anchored on 2017 S4 *Minimum Cost Flow*

On this page

Minimum spanning trees