Let’s do it again! I’m starting a day late, but much better than last year 😄!
This time around, I’m hoping to solve each problem in both Python and Racket, both to show an example of how the languages differ and … well, because I can 😇.
EDIT 2018-12-05: Yeah… I’m not actually going to do these in both Racket and Python. The solutions are ending up being near direct translations. Since there are probably fewer people solving these in Racket, I’ll do that first and Python eventually™.
As always, these problems are wonderful to try to solve yourself. If you agree, stop reading now. This post isn’t going anywhere.
If you’d like to see the full form of any particular solution, you can do so on GitHub (including previous years and possibly some I haven’t written up yet): jpverkamp/advent-of-code
Here’s a full list of all of the posts:
Posts in Advent of Code 2018:
- Advent of Code 2018
- AoC 2018 Day 1: Sum-thing to start with
- AoC 2018 Day 2: Counting letters
- AoC 2018 Day 3: Regionification
- AoC 2018 Day 4: Sleeping on the job
- AoC 2018 Day 5: Alchemical reduction
- AoC 2018 Day 6: Infinite Area Simulator
- AoC 2018 Day 7: Job Simulator
- AoC 2018 Day 8: Checksum Treeification
- AoC 2018 Day 9: Marble Madness
- AoC 2018 Day 10: It's Full of Stars!
- AoC 2018 Day 11: Gridlocked Fuel
- AoC 2018 Day 12: Fat Cellular Automaton
- AoC 2018 Day 13: Mine Cart Madness
- AoC 2018 Day 14: Functionally Circular Elfs
And here are my previous year’s solutions: