Commit graph

6 commits

Author SHA1 Message Date
02927269a8 feat: solve day6, part 1
For the first part of day 6 we parse each word on each line as either
a number or as an operator (multiplication or addition). We then order
them all by column and calculate the final value once we have all
numbers and the operator.

Most of the work takes place in the parsing function, the rest is just
summing it all up.
2025-12-06 08:25:55 +01:00
19e994ef71 feat: solve part 1 day 5 2025-12-05 21:51:10 +01:00
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
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
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