Advent_of_Code2021 VS aoc-2021-cpp

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