Advent_of_Code2021 VS aoc21

Then I wrote a small algorithm which finds the minimum and maximum values: no brute force needed- Full code with extra explanation on github.

My code is super slow: takes about 15 minutes for part 2. There is much too improve: will take a good look at this after the 25th.

My code is not yet as efficient as it could be: i takes about 4-5 seconds for both parts.

Today was my cheatday as I used the tidyverse library :) github

Today was quite easy again. The only challenging part in my input was that light pixels surrounded by only light pixels turn dark (and vice versa). github

For a while I didnt think I was going to make it :) But here I am :) github.

I first computed bounds and checked within a certain region of velocities. Compared with yesterday this was a piece of cake. I guess for must inputs the solution to part1 is simply y*(y+1)/2 where y is the absolute value of the lower bond - 1. github

Well save to say, this was my least favorite puzzle since 2018: and I still had a lot of fun :) I used two global variables: one keeping track of the current index and adding up the version numbers. I am praying that there won't be a follow up on this :D github

The full code is on github

cleaned up my code a little. Both parts run in 40ms. Full code with comments is on github

Last year I have used Python without using any imports and, whenever I felt like it, tried to golf it as much as I could. Turned out easier than I expected: https://gitlab.com/dos1/AoC21

There were only like two or three days that felt frustrating, but mostly because of the problem being poorly specified.

Here's the code, although it probably won't be of a huge help as it's not supposed to be readable: https://gitlab.com/dos1/aoc21/-/blob/main/day15.py ;)

A pretty straightforward binary tree-based implementation: https://gitlab.com/dos1/aoc21/-/blob/main/day18.py