1
0
Fork 0
Monorepo for all old Advent of Code solutions
Go to file
Jonathan Chan d378e3e50e Day 15 - takes 2+ minutes to run and froze my computer twice but it works I guess... 2017-12-14 23:49:03 -08:00
.gitignore Day 1, done! (Late oops) 2017-12-02 09:41:43 -08:00
01.hs Prepended single-digit files with 0s for nice ordering. 2017-12-12 09:29:13 -08:00
01.txt Prepended single-digit files with 0s for nice ordering. 2017-12-12 09:29:13 -08:00
02.hs Prepended single-digit files with 0s for nice ordering. 2017-12-12 09:29:13 -08:00
02.txt Prepended single-digit files with 0s for nice ordering. 2017-12-12 09:29:13 -08:00
03.hs Prepended single-digit files with 0s for nice ordering. 2017-12-12 09:29:13 -08:00
04.hs Prepended single-digit files with 0s for nice ordering. 2017-12-12 09:29:13 -08:00
04.txt Prepended single-digit files with 0s for nice ordering. 2017-12-12 09:29:13 -08:00
05.hs Prepended single-digit files with 0s for nice ordering. 2017-12-12 09:29:13 -08:00
05.txt Prepended single-digit files with 0s for nice ordering. 2017-12-12 09:29:13 -08:00
05_alt.hs Prepended single-digit files with 0s for nice ordering. 2017-12-12 09:29:13 -08:00
06.hs Prepended single-digit files with 0s for nice ordering. 2017-12-12 09:29:13 -08:00
06.txt Prepended single-digit files with 0s for nice ordering. 2017-12-12 09:29:13 -08:00
07.hs Prepended single-digit files with 0s for nice ordering. 2017-12-12 09:29:13 -08:00
07.txt Prepended single-digit files with 0s for nice ordering. 2017-12-12 09:29:13 -08:00
07_cumulate.txt Prepended single-digit files with 0s for nice ordering. 2017-12-12 09:29:13 -08:00
07_tree.txt Prepended single-digit files with 0s for nice ordering. 2017-12-12 09:29:13 -08:00
08.hs Prepended single-digit files with 0s for nice ordering. 2017-12-12 09:29:13 -08:00
08.txt Prepended single-digit files with 0s for nice ordering. 2017-12-12 09:29:13 -08:00
09.hs Prepended single-digit files with 0s for nice ordering. 2017-12-12 09:29:13 -08:00
09.txt Prepended single-digit files with 0s for nice ordering. 2017-12-12 09:29:13 -08:00
10.hs Day 10 - condensed a lot of functions and used normal lists instead of Seq 2017-12-12 09:29:07 -08:00
10.txt Day 10 2017-12-12 09:29:07 -08:00
11.hs Minor refactorings of days 3, 4, 5, 6, 7, 9, 11, and removed alternate solution (i.e. the original one) for 9. 2017-12-12 09:29:10 -08:00
11.txt Day 11 2017-12-12 09:29:07 -08:00
12.hs Day 12 - minor refactoring 2017-12-12 09:29:10 -08:00
12.txt Day 12, plus some edits to days 1 and 2 2017-12-12 09:29:10 -08:00
12_graph.hs Day 12 - use array constructor instead of graphFromEdges, which needs and produces some extra stuff. 2017-12-12 15:30:16 -08:00
13.hs Day 13 2017-12-12 22:59:14 -08:00
13.txt Day 13 2017-12-12 22:59:14 -08:00
14.hs Day 14 - condensed some stuff, it's fine 2017-12-14 15:06:36 -08:00
15.hs Day 15 - takes 2+ minutes to run and froze my computer twice but it works I guess... 2017-12-14 23:49:03 -08:00
README.md Create README.md 2017-12-12 09:28:40 -08:00

README.md

Advent of Code 2017

Hopefully most of these solutions are fairly self-explanatory. I'll write longer-length explanations for harder questions.

Posts

Day 3: Spiral Memory (problem description)