My solutions for this year's AoC. I am using it as a way of learning Go.
- Day 1: very nice + big success (got tempted to over-engineer)
- Day 2: very nice + big success (with a regexp-shaped hammer, every problem is a regexp-shaped nail)
- Day 3: very nice + big success (tried out the various ways of declaring slices / arrays)
- Day 4: very nice + big success (match those patterns!)
- Day 5: very nice + big success (round and round we go, this could be more efficient...)
- Day 6: very nice + big success (could do with refactoring...)
- Day 7: very nice + big success (I will need a Bag of Holding by the end of this)
- Day 8: very nice + big success (enjoyable program error correction, which makes a pleasant change)
- Day 9: very nice + big success (seemed suspiciously straightforward today - is there something encrypted in the data???)
- Day 10: very nice + big success, eventually (part 2 was difficult and I had many false starts)
- Day 11: very nice + big success (easier today but tripped up over copying slices vs arrays)
- Day 12: very nice + big success (I added a plotter to draw the ship route, but sadly didn't yield anything funny)
- Day 13: very nice + big success (part 2 was too hard, but I learned that brute force is the wrong approach in these puzzles)
- Day 14: very nice + big success (there is probably an easier way using l33t b1nary ski11z, but I don't have those)
- Day 15: very nice + big success (found a performant answer quickly today, not as conceptually hard as previous 2 days)
- Day 16: very nice + big success (felt like solving a sudoku)
- Day 17: very nice + big success (it was a mistake to go down the route of n-dimensional slices - maps ftw)
- Day 18: very nice + big success (enjoyed the bracketing reduction, could have written a neater answer, must use more small functions)
- Day 19: very nice + FAIL (my part 2 does not produce the right answer and I don't see why)
- Day 20: very nice + eventual big success (this was a bit ridiculous, but I got there in the end...)
- Day 21: very nice + big success (a refreshingly straightforward solution today, I think I was just on the right path from the start)
- Day 22: very nice + big success (the format of the log entries was my undoing at first - very strange)
- Day 23: very nice + big success (learned linked lists, and then realised a map of the inverse was the key to very fast execution)
- Day 24: very nice + big success (learned a coordinate system for hex grids; once in place, this was quite straightforward)
- Day 25: very nice + wtf (easy decryption once the instructions were understood - but there is no part 2! sad)