My Advent of Code 2023 solutions https://adventofcode.com/2023
Go to file
Keenan Tims 842def62dc
day16: back to elegant recursion now that we track beams
problem 1 solution was busting the stack, so used an iterative approach,
but now that we track lit beams we can bail out early enough not to bust
the stack. performance is the same but it's much nicer.
2023-12-15 23:54:22 -08:00
1 Move .gitignore to the parent 2023-12-05 13:16:21 -08:00
2 day2: problem 2 solution 2023-12-05 13:25:11 -08:00
3 day3: problem 2 solution. this is ugly. 2023-12-05 18:49:36 -08:00
4 day4: Add tests 2023-12-05 21:45:49 -08:00
5 day5: reimplement in a sane, fast way 2023-12-15 18:10:29 -08:00
6 day6: problem 2 solution 2023-12-06 18:15:36 -08:00
7 day7: problem 1 & 2 solutions 2023-12-06 22:37:02 -08:00
8 day8: problem 1 & 2 solutions 2023-12-07 22:07:07 -08:00
9 day9: formatting 2023-12-08 21:41:30 -08:00
10 day10: problem 2 solution 2023-12-10 00:02:29 -08:00
11 day11: problem 1 & problem 2 solutions 2023-12-10 22:34:39 -08:00
12 day12: problem 2 solution 2023-12-12 02:20:53 -08:00
13 day13: problem 2 solution 2023-12-12 22:20:54 -08:00
14 day14: itertools is not used anymore 2023-12-14 15:43:11 -08:00
15 day15: functional hash implementation using fold() 2023-12-14 23:33:48 -08:00
16 day16: back to elegant recursion now that we track beams 2023-12-15 23:54:22 -08:00
boilerplate/src boilerplate: remove unnecessary Duration import 2023-12-15 20:56:13 -08:00
.gitignore Move .gitignore to the parent 2023-12-05 13:16:21 -08:00