Commit graph

7 commits

Author SHA1 Message Date
Jacob Jonsson
47259d1697 feat: solve day4 part 1
We look at each valid (having coordinates inside the grid) neighbor to
a cell including a paper roll and then see if the neighbor contains a
roll of paper or not. Finally we count the number of rolls, if it is
less than 4 we can pick it.
2025-12-04 23:21:42 +01:00
Jacob Jonsson
19194b5d78 feat: solve part 2 day 3 2025-12-03 23:07:54 +01:00
Jacob Jonsson
249365968a feat: implement day 3, part 1
The solution I went with is to walk the entire bank of batteries with
their joltages and pair them up. At every step I can either form an
incomplete candidate (Left x), or a complete candidate (Right (a, b))
if I already have a previous candidate.
2025-12-03 22:09:09 +01:00
Jacob Jonsson
3f0d19a5d1 feat: solve part 2 of day 2 2025-12-02 15:49:25 +01:00
2e8920cae1
feat: solve day2 part1 2025-12-02 08:31:24 +01:00
12d392e578
feat: solve day1 2025-12-02 08:01:56 +01:00
fd14a98915
chore: add scaffolding 2025-12-02 08:01:11 +01:00