Leetcode - Path With Minimum Effort (Python)

January 2021 Leetcode Challenge
Leetcode - Path With Minimum Effort #1631

[xvzf]

1337 af. Thank you for sharing this, great explanation.

[almasabdrazak]

If I can't solve the problem, first thing I check if you have a video that covers it, if no then check Leetcode discussion and Hope I will get how solution works

[paradox]

why not push the max(new_k, k) instead of "new_k"

[networking_coding_else]

the same (r, c) could be push to the heap several times, if you have a big matrix where every node/cell have the same "height" but the target (matrix[-1][-1]) has a higher value it could be a issue...or am I missing something?
a dictionary (node_cost) could be use to track the cost of each node (r, c), so only (r, c) with lower cost are push to the heap

[ChanChan-pgwu]

You definitely knows more than me! Thanks!

[chrisshao]

Hi, just wondering why mn starts at -1 instead of 0