Kharec 24a65d3752 feat: solve part one using brute-force permutation search

2025-12-08 21:26:06 +01:00

..

2015

feat: solve part one using brute-force permutation search

2025-12-08 21:26:06 +01:00

2016

feat: solve part two

2025-12-07 22:01:36 +01:00

2018

feat: solve part two

2025-12-07 00:00:16 +01:00

2020

feat: simplified input parsing by appending all lines directly

2025-12-04 17:32:36 +01:00

2021

feat: solve part two

2025-12-06 23:43:01 +01:00

2022

feat: add per-year aggregator packages so main.go remains readable

2025-12-02 09:51:21 +01:00

2025

feat: tiny refactor for part two which we're solving using Kruskal's algorithm

2025-12-08 15:21:42 +01:00

data

chore: add D13 dataset

2025-12-08 17:39:07 +01:00

registry

refactor: massive refactor to have only one binary to call

2025-11-26 14:04:13 +01:00