Note: This topic is to talk about Day 25 of the Advent of Code.
For general discussion about the Advent of Code 2018 and links to topics of the other days, see this topic.
It’s with mixed feelings that I post my final solution for 2018.
On the one hand, I can go back to sleep when I wake up at five in the morning. On the other hand, I will miss the excitement of coding a solution, learning some more Elixir in the process, and getting my stars.
Merry Christmas! 
6 Likes
My solution is here. Instead of using digraph, I just implemented a naive greedy recursion.
I still have to do the second part of day 23, so I’ll enjoy AoC a bit longer 
I had fun solving these challenges and comparing solutions with others. Learned a few new things in the process (like summed area table), and exercised my brain. Looking forward to the next edition!
Merry Christmas!
5 Likes
