AoC VS AdventOfCode2021FSharp

Yeah, I got stuck on that as well, but in the end I think the solution wasn't that hard to do recursively. You can check my code on Github

My solutions as per usual at my Github

Python with numpy and networkx solution on my Github.

My Python solution is available on my Github

My Python solution: https://github.com/tomribbens/AoC/tree/main/2021/day02

I was having a hard time figuring out day 12 of Advent of Code. In the end I gave up and went looking for some solutions. I came across this one and this one. However, I didn't quite understand what they did.

F# solution in Jupyter Notebook. Got some help from this thread.

F# solution in Jupyter Notebook. Part 1 takes 500ms but Part 2 takes 24s. Any suggestions on where performance could be improved would be appreciated!

F# solution in Jupyter Notebook. Thank God for the Haskell programmers! I would not have been able to solve this without peeking at their some of their code. Parsing the input string was just the first of the challenges! I envy those dynamic programming languages with an eval function.

F# solution with Jupyter Notebook. Brute force. I actually solved Part 2 before solving Part 1, unknowingly.

F# with Jupyter Notebook. Learned how to use recursive types today! Half-way through the problem I was starting to wonder whether BITS was going to be the new IntCode.

So this year I'm learning F# and functional programming. I could not figure out a immutable solution. So I went with an imperative, mutable solution and did pretty much a straight port from Red Blob Games including using a PriorityQueue.

F# with Jupyter Notebook.

F# with Jupyter Notebook. Slow but works. I'll probably come back to this day and optimize the solution.

F# in Jupyter Notebook. Decided to go with an infinite sequence (generator pattern) for the steps. This made Part 2 a breeze!