aoc-25

0 Tags

109 KiB

Author	SHA1	Message	Date
Jacob Jonsson	19e994ef71	feat: solve part 1 day 5	15 hours 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.	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.	3 days ago
Jacob Jonsson	2e8920cae1	feat: solve day2 part1	4 days ago
Jacob Jonsson	12d392e578	feat: solve day1	4 days ago