Please state the language when you ask questions like these. From your profile I see it's C#.
The inital height (cell x = 0, y = 0) is 7, so if you just follow the path of cells where height is 7, you don't need to climb up or down at all. Which is why the result should be 0.
Note that it's not about having path of lowest heights, but total lowest difference of all climbs.
No problem ! Best of luck with this one :D I recently solved it myself, but part 3 was the last one that I was able to solve :<
Please state the language when you ask questions like these. From your profile I see it's C#.
The inital height (cell x = 0, y = 0) is 7, so if you just follow the path of cells where height is 7, you don't need to climb up or down at all. Which is why the result should be 0.
Note that it's not about having path of lowest heights, but total lowest difference of all climbs.
Does that make it any clearer?