As I did last year, I’m going to solve the Advent of Code problems again this year.

Or that was the plan. It turns out that instead I put down my blog for almost a year and a half and never quite got around to doing these problems. So I’m actually backdating these posts from the early days of 2018 to where they would have been had I solved them on time. They’re still interesting problems, so give them a read.

If you’d like to see all of the solutions, here’s a list:

Like I noted last year, I generally feel that these problems are more interesting if you take a crack at solving them yourself first. If you feel the same way, stop reading. This post will still be here when you’re done, I promise.

If you’d like to see all of my solutions (even before I’ve posted them), they’re on GitHub: jpverkamp/advent-of-code

If you’ve solved the puzzles as well and posted your solutions, post a link below. I’d love to see how others approach the problems.

Here is a link to last year’s posts:

• Advent of Code 2015

My particular favorites are:

• Day 5: Password Cracker - Animated output
• Day 7: IPv7 Support Counter - Regular expressions used in interesting ways
• Day 11: Radiation Avoider - Quite a problem in optimization
• Day 12: Assembunny - I enjoy writing virtual machines
• Day 13: Noisy Puzzle - I rather enjoy procedural content
• Day 14: Bad One-Time Pads - Not useful as an actual one-time pad (they’re deterministic), but interesting to calculate
• Day 21: Scrambler - Another virtual machine of sorts
• Day 23: Assembunny v2 - An extension of day 12 involving self-modifying code and an optimizing compiler
• Day 25: Assembunny v3 - An extension of day 12 involving simple binary output and loop detection