Advent of Code 2019 in go
-
Day 1 - done
-
Day 2 - (I) - done
-
Day 3 - done
-
Day 4 - done
-
Day 5 - (I) - done
-
Day 6 - done
For Part 1, I didn't need a graph. I used a simple recursive solution. That led to a memoization opportunity.
For Part 2, I used a graph library that was somewhat clunky, but workable. I couldn't find a graph library that worked simply with interace{} nodes. That seems like the obvious approach to me, so there are probably complications I'm missing.
-
Day 7 - (I) - done.
-
Day 8 - done.
I == intcode