advent-of-code VS aoc2021

Python. Figured part 2 would render a naive brute-force approach unusable (as it usually is with these kinds of puzzles) so I tried to come up with an efficient solution from the get go. Results pretty much instantly for both parts.

Python. So many games of life this year. I'm not bothered though :D

Python - I'm so glad I finally got this! There were some very helpful comments about today's Part 2 on this sub that helped me get on the right track. You can sorta see my process with list slicing at first which worked fine for Part 1, and then moving on to a linked list for Part 2. Takes a little under 35s to execute, which is abysmal, but I showed the crab who's boss and don't really feel the need to mess with it any more lol.

Python. Part 2 threw me for a loop (similar to many others here, it seems) but it's nice to be reminded to read the instructions carefully and not just rely on results from the sample inputs. Not terribly performant, but it runs quickly enough and the code is hopefully not too hard to read, so I'm quite happy with it.

Very similar to mine, I used .rotate(1) on my ages array then added the element at the end to the element at index 6. https://github.com/MichaelCG8/aoc2021/blob/main/src/bin/06.rs

Also, instead of summing the remaining values at the end I summed them all at the start then subtracted them as they were checked off, meaning that i didn't need to store a Boolean for each entry recording whether it remained. https://github.com/MichaelCG8/aoc2021/blob/main/src/bin/04.rs