Problem 1885. Minimum Sum thru a Lower Triangle
This Challenge is to find the minimum cumulative sum that traverses from row-1 thru row-N via vertical/diagonal adjacent elements of adjacent rows.
The input is a series of values of length n*(n+1)/2.
Input: S [Series that can be converted into a lower triangle]
Output: MinSum [Minimum cost path from top to bottom]
Example:
[5 7 6 3 2 5] becomes
5 0 0 7 6 0 3 2 5
Creates a MinSum of 13 [5+6+2]. The 5 can only see 6, 3 sees 7 and 6, while 2 sees 7 6 0.
Solution Stats
Solution Comments
Show commentsProblem Recent Solvers13
Suggested Problems
-
Find all elements less than 0 or greater than 10 and replace them with NaN
15467 Solvers
-
301 Solvers
-
Pythagorean perfect squares: find the square of the hypotenuse and the length of the other side
53 Solvers
-
Getting the indices from a matrix
632 Solvers
-
Volume of a sphere given its surface area
144 Solvers
More from this Author308
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!