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.
I do not understand one of the sample test cases. How does the test case for f equal 0? Based off the description and other sample test cases, should it be 28? My reasoning is that you climb down 7, move right 2 to climb up 7 and climb down 7, move right until right boundary, then move down until you reach location (N-1)(N-1), where you climb up 7 and exit. So 7 + 7 + 7 + 7 = 28. Am I doing this wrong?
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 :<
This is very helpful, thank you!
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?
I do not understand one of the sample test cases. How does the test case for f equal 0? Based off the description and other sample test cases, should it be 28? My reasoning is that you climb down 7, move right 2 to climb up 7 and climb down 7, move right until right boundary, then move down until you reach location (N-1)(N-1), where you climb up 7 and exit. So 7 + 7 + 7 + 7 = 28. Am I doing this wrong?