advent_of_code VS Advent_Of_Code

Anyway my solution available on my GitHub

This was a tricky one, but I managed to solve it in an effective way (the lcm method). As always you can see it on my GitHub.

I really loved this one, I enjoyed doing it and I'm happy with how I managed to deal with it. You can see my solution to both parts on my GitHub.

My Day 6 solution on GitHub

Anyway, here it is.

Python, for part 1.

Comes with a free simple visualization of path lengths because I made it for debugging purposes and I thought it was actually pretty interesting. The end point has a value of 000, and you can follow the path there from anywhere on the map by going to a space with the next lowest number, i.e. starting at 010 -> 009 -> 008 -> 007... etc. Spaces with --- cannot reach the end point.

C++