Advent-of-Code VS Advent_of_Code_2021

For example, this was my solution for day 01 2021

To find the match, I created a Jupyter Notebook to visualize the points with the simple example. After staring 30 minutes into 3d charts, I finally figured out that whenever I find a rotation that matches, then there must be a vector v, which occures a lot of times when comparing each p1 from scanner 1 with each point p2 from scanner 2, because we only have to shift it by this vector to align with the scanner 0 (see jupyter notebook first plot).

Python 3, <1ms runtime

Python3

Python solution. Part 1 runs in no time at all. Part 2 takes about 1.2 s which, I think, is because I am creating the entire 500x500 grid at the beginning. I suspect that I could speed it up considerably by only creating a grid in a direction when I get there, maybe create the next tile to the right and down when I get to a tile. A tile update function would probably not be too difficult as each cost would be an (x,y) multiple of the cost's base (x,y). I'm going to attempt to bring this to below 1s. :D

Python

My solution in Python. Part 1 was pretty easy to do with sets. For Part 2, I just printed to console and put in the letters. :D

Surprised at the pretty small input file size :D but pretty easy Python solution using dicts, lists, and sets. Python comprehensions just make life so much easier.

Finally managed to solve Part 02 in Python. I was stuck because I could not figure out a way to go through all the points around a low point till I got to a 9. Then yesterday I say u/skarlso's post about Red Blob games and the various pathing algorithms, and the breadth-first-search example just unblocked the whole solution for me. :)

Python solution that takes about a second for part 2. The logic is the same for both parts, just changed the number of days it runs for.

Bless Python's sets! Makes checking for membership such a breeze!

Python

Pretty easy with Python. Some list comprehension, some count, some join, some int and it's done. Could be more efficient, of course. 😁

Simple Python-based solution yet again.