adventOfCode2023 VS advent-of-code

[Language: JavaScript] github 8ms.

[Language: JavaScript] github Spent a while trying to get part2 correct. Just to realize i missed the "J cards are now the weakest" line... Fun problem though!

[Language: JavaScript] github 23ms. Pretty naive approach but it works. Searched from longest and shortest possible press inwards until a max and min winning value's found.

Code lives here and I scheduled a [blog post here](rope-bridge-solving-advent-of-code).

In the rest of the code I simply iterate through cubes and multiply the edges with the saved values.

Today was rough. Code is too long to post here. Github Basically using indexes and a bit of recursion for this.

It lives on Github and I made a visualization.

Python 3. Figured I'd learn some more networkx. Was useful for the "smol" attribute in the end and easily getting the neighbors. Full code is on Github.

The two scorer functions live on Github.

The full code with comments lives on Github. But here's the meat without comments for brevity:

And this is how simple it can be to build some relatively robust tests. All of this lives in a tests folder so pytest automatically finds it in a file called test_day05.py. You can see the file on Github.

Kept it fairly simple in Python. Runs in half a second for both parts together.