Learning Areas¶

This folder is the teaching-first layer of the repository.

Do not try to open all areas at once.

Pick the area that matches your current bottleneck, then stay inside that family until one ladder note feels routine.

Tier Guide¶

Core Bridge Deep Enrichment

Area	Tier	Start here if you need...	First stop
`Foundations`	`Core`	cleaner C++, complexity habits, and bread-and-butter patterns	Foundations
`Data Structures`	`Core`	standard tools for range queries, connectivity, and updates	Data Structures
`Graphs`	`Core + Bridge`	modeling, traversals, shortest paths, trees, flow, and matching	Graphs
`Dynamic Programming`	`Core + Deep`	state design, transitions, and optimization over structure	Dynamic Programming
`Math`	`Core + Deep`	modular arithmetic, combinatorics, and number theory tools	Math
`Strings`	`Core + Deep`	pattern matching, hashing, tries, and suffix structures	Strings

Area	Tier	Start here if you need...	First stop
`Combinatorics`	`Bridge + Deep`	counting, bounded distributions, and lexicographic enumeration	Combinatorics
`Geometry`	`Deep`	vectors, orientation, hulls, and geometric counting	Geometry
`Greedy`	`Core + Bridge`	exchange arguments, feasibility-first thinking, and locally safe choices	Greedy
`Advanced`	`Enrichment`	randomized algorithms, approximation, complexity, and algorithm design depth	Advanced

Use the repo layers in this order whenever possible:

Layer	Main question	Best door
`Learn`	what is the idea and why does it work?	one area page here, then one leaf topic
`Practice`	where do I solve the idea on purpose?	the corresponding ladder, then one anchored note
`Retrieve`	what is the shortest way back under pressure?	Build Kit

If you already know the weak topic and just need the next problem set, jump to Problem Finder instead of browsing area pages.

When one family feels wider than your mental map, reopen the bridge page first instead of clicking random leaf topics.

Family starts feeling fragmented	Tier	Reopen this bridge	Then branch into...
trees	`Bridge`	Trees	subtree queries, LCA, HLD, virtual tree, tree DP
flow and cuts	`Bridge`	Maximum Flow	lower bounds, Gomory-Hu, global min-cut, min-cost flow
divisibility and congruences	`Bridge`	GCD / LCM	CRT, modular arithmetic, prime-exponent constructions
transform-heavy algebra	`Bridge`	FFT / NTT	polynomial / FPS
bit-state techniques	`Bridge`	Bit Tricks	bitmask DP, SOS, FWHT, xor basis, bit-parallelism
explicit search trees	`Bridge`	Recursion And Backtracking	bitmask DP, meet-in-the-middle, complexity triage
monotone scans	`Bridge`	Monotonic Stack / Queue	nearest boundary, sliding extrema, histogram-style problems

If you want the whole non-foundational surface in one visual instead of one area at a time, use Deep Topic Taxonomy.