Click here to see the full article post
@awice Why is the answer for below data 15?
Shouldn't it be 11?
Totally 11 steps.
Am i missing something?
@sharathnarayan Wrong forum topic, and the answer is (perhaps?) because the path is 4-directional.
Actually you should phrase as Dijkstra's is a special case of A* search with node.h = 0 always.
Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.