GitHub - kernzerfall/aoc25: Some mathematically interesting pure Haskell solutions to Advent of Code 2025

kernzerfall / aoc25 Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

Some mathematically interesting pure Haskell solutions to Advent of Code 2025

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 4 Commits
.gitignore		.gitignore
Makefile		Makefile
d01-a.hs		d01-a.hs
d01-b.hs		d01-b.hs
d02-a.hs		d02-a.hs
d02-b.hs		d02-b.hs
d03-a.hs		d03-a.hs
d03-b.hs		d03-b.hs
d04-a.hs		d04-a.hs
d04-b.hs		d04-b.hs
d05-a.hs		d05-a.hs
d05-b.hs		d05-b.hs
d06-a.hs		d06-a.hs
d06-b.hs		d06-b.hs
d07-a.hs		d07-a.hs
d07-b.hs		d07-b.hs
d10-a.hs		d10-a.hs
readme		readme

Repository files navigation

Some of my solutions to Advent of Code 2025 that I found mathematically
interesting. Focus is on _math_, and _not_ speed or efficiency.

If a solution to a day/part is missing, I either bruteforced it, or
couldn't do it in pure Haskell (i.e. used Monad.ST or similar).

All solutions expect the input on stdin.

Highlights:
	- d01-b: total variation
	- d02-a: finite arithmetic progressions
	- d02-b: combinatorial inclusion-exclusion
	- d05-b: orthogonalisation + lebesgue measure over integer lattice
	- d07-b: backward induction