Tip: if you're stuck on part 2 (like me) because y...

# advent-of-code

[ilya.gorbunov]

Tip: if you're stuck on part 2 (like me) because your code gives the right result for the example input, but wrong for your own input, check that your path finding algorithm of part 1 produces the right result for the following input (in thread)

[ilya.gorbunov]

199111
199191
111191
999991

Expected to get the path with the min risk of 12

[Todor Grudev]

That’s useful, thank you 🙂