aoc-25

8 Commits

1 Branch

0 Tags

109 KiB

Commit Graph

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.	2 days ago
Jacob Jonsson	19194b5d78	feat: solve part 2 day 3	3 days ago
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.	3 days ago

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.

2 days ago

Jacob Jonsson

19194b5d78

feat: solve part 2 day 3

3 days ago

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.

3 days ago

3 Commits (8e780753c1c7dcba7f93fc5973f30b5f044aaafe)