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

Data Structures II

BIT and segment trees

occasional

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.

Sweep line and geometric counting

Sweep line and geometric counting — anchored on 2014 S4 *Tinted Glass Window*

On this page

BIT and segment trees