Advent_Of_Code VS advent-of-code

Python, for part 1.

Comes with a free simple visualization of path lengths because I made it for debugging purposes and I thought it was actually pretty interesting. The end point has a value of 000, and you can follow the path there from anywhere on the map by going to a space with the next lowest number, i.e. starting at 010 -> 009 -> 008 -> 007... etc. Spaces with --- cannot reach the end point.

C++

[LANGUAGE: Python]

Python, Part 1 Only

Python

Rust Version

Rust

When I get back home after the holiday weekend I'll try benchmarking on my machine properly. But here's my version (in Common Lisp): https://github.com/rabuf/advent-of-code/blob/master/2018/2018.09.org

Rest of 2021

I'm partial to Common Lisp, but both Scheme and Racket would be good choices as well. There's a few of us who've been using CL the last few years to solve (nearly) every puzzle. If you want to see (not always great) solutions to the puzzles in Common Lisp, here's my repo, of course don't look at days you haven't solved yet unless you want spoilers. But it can give you a feel for how CL can be used to solve the problems. I'd intended to revisit them and clean them up, but never got around to it.

Interestingly, I think that solution is rather near the memoized version in one key regard. It's not memoization, however it's still storing all the results (the count for every joltage adaptor). You can massively reduce its storage by going with something like my solution (C-f for "part 2", there are two solutions one in Common Lisp and one in Ada), which is like the non-memoized iterative fibonacci series (psuedocode, pythonesque):