advent-of-code-2021 VS AoC

Python solution. If you look at the input you might notice that there is not a single path from uppercase cave to uppercase cave, so with recursion there is no way code can get stuck. It also means that you don't need to keep track of the finished paths because there is no way to generate duplicates.

I did with recursion too, but to make a point flash it must have exactly value 10. So I just need to edit all numbers that have value over 9 to a zero at the end. Don't know if its any faster :D My Python solution using external library Numpy

Python 3 Got my solution running in less than 1ms using Counters

PYTHON. I did first version without Numpy but decided that its way too useful so I did some refactoring and below is my solution. It's a bit slow so not the most optimal.

20ms both parts https://github.com/Fadi88/AoC/blob/master/2023/day11/code.py

Same Algo as my python code from earlier, now just using math not search space reduction also blazing fast in micro seconds https://github.com/Fadi88/AoC/tree/master/2023/day06