aoc VS advent_of_code

Copy paste the equations into a Python script and solve for the maximum/minimum using the Z3 solver, which this time can manage to work in a decent runtime (~30s).

Same! I have my 2018 d19 decompiled here. I just love throwing gcc -Ofast at stuff.

Are there any advent of code walkthrough website (code + explanation) which I can read and learn rather than try and get stuck? I found one github website by mebeim which it is great. I'd like to read more and understand other method to solve the puzzle. Anyone could recommend me more please?

Thanks to this explanation I now understand why the graph must be directional.

If you like this, you will love https://github.com/mebeim/aoc/tree/master/2020

The guy created very clean python solutions, and very insigthful walkthrough (although a bit wordy some times). It was my go to repo after validating my solutions on AoC (he managed to publish daily during the whole challenge !).

Oh yeah, it's little less than 1s with PyPy (I talked about how I tried optimizing it in my walkthrough), which is still pretty slow if you ask me. However the slowest day for me was day 24 :( couldn't do much about it, takes 2s even with PyPy (suggestions for improvement welcome).

Python 3 clean solution - alternative [ab]using only Python's re module - walkthrough of both.

Python 3 solution - Walkthrough

Brute force like most people I think - kept wondering if there was going to be some horrible gotcha that meant brute force would not work, but it did.

part1