advent-of-code-my-solutions VS adventofcode

https://github.com/ColasNahaboo/advent-of-code-my-solutions for the 2021 version, so that year is technically possible too...

My repo, with comments: https://github.com/ColasNahaboo/advent-of-code-my-solutions/tree/main/bash/2021

As I see there is no bash solution yet, here is mine: https://github.com/ColasNahaboo/advent-of-code-my-solutions/blob/main/bash/2021/days/d06-1.sh Runs in less than 100ms. It is a linear solution with bins, but the bins are not based on the fishes timers. There is a bin for each day, with the number of timers reaching zero ==> fishes born on the next day.

Part one went fairly fast, but spent quite some time on getting part two right. I settled on the approach of just iterating over the grid and using a boolean to see if I had to count elements or not. However, I had some issues figuring out when to swap, this post by /u/rogual helped me figure it out. After that I lost quite some time on an error that only occurred with my input, not with the example input. It turned out that my loop (which I take form my p1 solution) didn't include the start node, which caused all sorts of counting issues.

[Language: Elixir] https://github.com/mathsaey/adventofcode/blob/master/lib/2023/4.ex