Advent-of-Code VS adventofcode

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 day 17 solution (GitHub). Not the fewest lines of code, but used dataclasses and modular functions to try improve readability -- I got very confused with keeping track of indices of velocities vs coordinates in other people's posted solutions. I find dataclasses in Python can be a great way to be descriptive about the quantities you are iterating

Python day 15 solution (GitHub) using Networkx for graph algorithm and Numpy for building the bigger grid. Solutions to other days available in this repo

Python day 14 solution (GitHub). Tried splitting out the logic into individual functions to aid readability.

Python day 13 solutions (GitHub). Using Dataclasses to improve readability

Python solution (GitHub) using Gauss formula for part 2

Python solution using deque (GitHub). Much faster than my first attempt, lol

Python day 5 solutions using Bresenham's algorithm (Github)

Python solution day 4 OOP (GitHub). Probably not the fewest lines of code but uses dataclasses and OOP to manage the states of each bingo card

Python day 2 solution (GitHub)

Python day 1 solution (GitHub) using numpy's convolve function for sliding window calc