Minimum Sum thru a Lower Triangle - MATLAB Cody - MATLAB Central

Problem 1885. Minimum Sum thru a Lower Triangle

Difficulty:Rate

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

76.0% Correct | 24.0% Incorrect
Last Solution submitted on Apr 03, 2020

Solution Comments

Show comments
Why should you share code?
In a discussion on LInkedin about my recent blog post, Do these...
3
6

Problem Recent Solvers13

Suggested Problems

More from this Author308

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!