Home

Jump to bottom

Alexandru Dinu edited this page Dec 29, 2024 · 7 revisions

Challenges

Concepts

Advent of Code

parsing
grids
graph algorithms: cuts, connected components, bridges, cliques etc.
path-finding and state-space search: BFS / DFS / Dijkstra / A*, heuristics
caching (memoization)
loop / cycle detection
constraint satisfaction
interval arithmetic
modular arithmetic
simple linear algebra
geometry (e.g. polygons)

See also: 450 Stars: A Categorization and Mega-Guide.

Clone this wiki locally