adventofcode.sh VS adventofcode

I have completed years 2015 and 2020 in bash. Gave up halfway through last year, might do that one day. https://github.com/einarjon/adventofcode.sh

Python3 is about 25% faster than Python2, with the exact same code. Pypy3 was somewhere in between. https://github.com/einarjon/adventofcode.sh/blob/main/2015/04.sh

Mine is on github too. I think that my worst abuse of grep is this: https://github.com/einarjon/adventofcode.sh/blob/main/19.sh Before the cleanup my part2 regex was around 6-7K chars.

My final script is in my repo, but an earlier commit has this brute force version. https://github.com/einarjon/adventofcode.sh in the 2021 folder.

Day 1 was 10 LOC, each day is adding about 10 LOC, so now I'm at 40. I don't like where this is heading. https://github.com/einarjon/adventofcode.sh/blob/main/2021/04.sh Small mistake in Part 2 so it starts the bingo from the beginning, but the first numbers are crossed out. Doesn't affect the result.

My solution this year was almost exactly like the one __abigail__ posted. I based it on last year's code for day 12. There are 50 days worth of bash solutions in that repo if you're interested. Some contain Voodoo, but it's mostly readable - I hope...

I linked to the code. Here it is again. Might be slower in git bash, but works. https://github.com/einarjon/adventofcode.sh/blob/main/13.sh

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