Yes, you are right, fixed the problem, it worked, thnanks!
Yup, your solution is buggy. Not a kata issue.
Please edit your comment and format your code, because currently it's totally unreadable mess.
I think I can see the mistake in your code, it probably fails when called more than once.
This comment is hidden because it contains spoiler information about the solution
suggesting that someone inspect / comment / fork / critique / review my translation attempt for Rust.
No, you don't always pick the highest number, otherwise you might end up on side with lower numbers and won't be able to reach bigger numbers later on.
I think you should to add negative numbers to random tests
Dynamic programming :D
I wrote here that my solution returned 11 in your example but 1064 in the medium pyramid but that was not true.
Actually I changed the test case myself to 1064 and when I fixed my algorithm the testcase failed.
As you compare each pair identify the MAX value in the pair. If you look at the tests, they assert that the value equals a total SUMed value - not a path. My inital attempts were focused on tracking the path (slide down), instead focus on the maximum sum.