AoC 2021

Day 12

No!!!! I made a simple error of incorrect nested indices which pushed me back a while, and lost me 2 points! Other than that, I think today was a very fun and satisfying challenge :D

Another classic BFS was what I did for Part 1, just the usual! Above, I uploaded a DFS because it was a much neater solution.

Part 2 was a small modification where I just had to keep track of whether or not a small letter had been repeated - I used the first element in the tuple for this. You may also notice that I surpassed the recursive limit for python - a simple fix exists though. Graph algorithms are very important to learn and implement fast! I've noticed that a lot of people had a dedicated seen set, along with the current position. I think what I did with just having a tuple of my path would be faster to code, but have a slower runtime if the graph was any larger!

For a weekend challenge, this is not too hard... unless Eric has planned something nasty soon (2020 20 flashbacks....)