Our great sponsors
-
WorkOS
The modern identity platform for B2B SaaS. The APIs are flexible and easy-to-use, supporting authentication, user identity, and complex enterprise features like SSO and SCIM provisioning.
-
InfluxDB
Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
-
SaaSHub
SaaSHub - Software Alternatives and Reviews. SaaSHub helps you find the best software and product alternatives
F#, Simple array based mutation, kept a track of sea Cucumbers, under 80 lines of code, mostly one liners
rust
python 453
Merry Christmas!
The code. Pretty much brute force.
code here, nothing special
Clojure (GitHub).
Interesting approach. I did away with a recursive function, Array.transpose and a bit of copypasta ...
Java (nothing special, simple implementation of the rules, I have only posted to fit for the rules here)
Simple C++ implementaion: https://github.com/rameshjanagama/AdventOfCode2021/blob/main/Day25/c21_d25.cpp
Python
First a straightforward solution with a double buffer, later realised you could do it in-place by just holding onto one value per row/column.
Mine in Rust: https://github.com/LinAGKar/advent-of-code-2021-rust/tree/main/day25/src
C
Today was way easier than the past week which is great, because I can relax a bit. I have rushed the code, so its not the greatest, but its here, in Javascript, if you want to see!
Day 25 Solution
Raku
rust Per step, this makes a list of all cucumbers that can move first, then mutates those in the overall map.
Plus Python visualisation
Took a while for me to get around to completing this in Kotlin, Python, and Rust as well, since I was working on optimizing other solutions, but I finally made it.