The ladder

Read a problem the way a contestant does: bounds, time, and the shape of a feasible solution. Arrays, search, sorting, and greedy become reflexes. Maps to USACO Bronze and Codeforces <1200.

Prefix sums, two pointers, hashing, sliding windows, and binary search on answers. These ideas clear a surprising fraction of Div. 2 A–C and almost all of USACO Silver searching.

Model grids and implicit graphs. BFS for unweighted shortest paths, DFS for connectivity, Dijkstra / 0-1 BFS, topological order, DSU, and MSTs. USACO Silver graphs through Gold shortest paths.

Knapsack, LIS, and grid paths. Name the state, write the transition, then prove it visits every subproblem once. This is the USACO Gold DP core and the usual Codeforces 1500–1800 wall.

Monotonic stacks, heaps, Fenwick trees, and the segment-tree mental model. Point updates plus range queries are the USACO Gold data-structure gate and most of CSES Range Queries.

Euclid, sieves, modular exponentiation, and binomial coefficients modulo a prime. CSES Mathematics and the number-theory tags that start appearing on every Div. 2 C.

Rolling hashes, the KMP prefix function, and the Z-algorithm. Substring equality in O(1) after setup, and the collision / overflow WA modes that make string problems infamous.

Diameter, binary lifting / LCA, Euler tours, and tree DP. CSES Tree Algorithms and the USACO Gold tree modules — rerooting waits in DP II.

Bitmask DP, interval DP, and digit DP. These are the USACO Gold/Platinum DP forms that show up as Div. 1 A–B and the usual jump from 'I know knapsack' to 'I can invent a state'.

Max-flow / min-cut and computational geometry (orientation, hulls). Low frequency on Codeforces Div. 2, high frequency in OI finals and CSES Advanced / Geometry. Enough to recognize the reduction.

The capstone: problem reading, debugging under a clock, skipping, and constructive / ad-hoc. Tools without this track stall at blue. This track without tools is theatre.