scrapyard VS adventofcode

Inspired by a blog post of Nicky Meuleman and his solution for this puzzle: https://github.com/NickyMeuleman/scrapyard/blob/main/advent_of_code/2022/src/day_08.rs I refactored my code and it turned out to be ~7-10 times slower than the initial one (700μs vs. 8ms). But hey, the code looks better now and it's more concise.

If you prefer to go straight to the repo: https://github.com/NickyMeuleman/scrapyard/tree/main/advent_of_code/2022/src

rust Per step, this makes a list of all cucumbers that can move first, then mutates those in the overall map.

Solution in Rust

Rust solution, commented both solutions to clearly explain the used logic.

Rust

Rust. The windows() method is really the MVP of the day

Code on GitHub is currently a mess.

In the spirit of the Day 5 ALLEZ CUISINE! challenge to ELI5 (Explain Like I'm Five), here's a tasty explanation of how my algorithm works using only a large bucket of Red Vines and a knife. It says to use lined paper, but if you try this at home consider aligning things on a cutting board.

[Language: Jsonnet] (on GitHub)

Elixir code, thoughts

Elixir 1554/1502 code, reflections

Elixir 2506/3402 (24 minutes, 2 hours), code, thoughts

Bonus solution in Go (golang) because I was confused about why my Elixir solution didn't work and decided to implement from scratch in case I'd done something dumb. The Go one also got the wrong answer, but took less than 100ms instead of a minute, so I could try out lots of tweaks that didn't change the answer.

Elixir 2031/2641 after 3.25/6.5 hours! Code on GitHub

I spent time this afternoon sprucing up my helpers for the iex REPL. I spent a bunch of time poking at things in IEx the last couple days and wanted to make sure I would minimize keystrokes if I needed to debug things on my phone while drunk. Turns out Thursday night > Friday night > Saturday night in terms of difficulty, so all those macros have so far saved me zero seconds :-)