aoc-25

0 Tags

109 KiB

Author	SHA1	Message	Date
Jacob Jonsson	8e780753c1	feat: solve day4 part 2 Part two is solved by repeatedly removing all free rolls until there are no more rolls to remove. When removing the rolls we keep a running count of how many rolls we've removed.	1 day ago
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.	1 day ago
Jacob Jonsson	19194b5d78	feat: solve part 2 day 3	2 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.	2 days ago
Jacob Jonsson	3f0d19a5d1	feat: solve part 2 of day 2	4 days ago
Jacob Jonsson	2e8920cae1	feat: solve day2 part1	4 days ago
Jacob Jonsson	12d392e578	feat: solve day1	4 days ago
Jacob Jonsson	fd14a98915	chore: add scaffolding	4 days ago