Problem 1885. Minimum Sum thru a Lower Triangle

Created by Richard Zapor

Solve Later

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.

Solve

Solution Stats

27 Solutions
14 Solvers

Last Solution submitted on Dec 04, 2025

Last 200 Solutions

Solution Comments

Show comments

Problem Recent Solvers14

Suggested Problems

chance in percent for minimum K heads when a good coin is tossed N times?

53 Solvers
Back to basics 12 - Input Arguments

618 Solvers
Return the first and last characters of a character array

11719 Solvers
Find and replaces spaces from a input string with *

168 Solvers
Repeat middle rows and columns of an array

37 Solvers

More from this Author308

PACMAT 04 - Optimized Ghosts, Equal Speed, 10 Lives

2 Solvers
ICFP2021 Hole-In-Wall: Figure Validation with Segment Crossing Check

2 Solvers
Criss-Cross: NHL - Optimize Matrix Size

3 Solvers
Usage of mkdir and copyfile

23 Solvers
PONG 001: Player vs Wall, 4 Lives, Interactive download

15 Solvers

Problem Tags

Community Treasure Hunt

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

Start Hunting!