Problem 42938. Project Euler: Problem 18, Maximum path sum I

Created by Riam Su

Solve Later

By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23.

       3*
     7*  4
   2   4*  6
 8   5   9*  3

3 + 7 + 4 + 9 = 23

Find the maximum total from top to bottom of a given triangle.

Solve

Solution Stats

247 Solutions
100 Solvers

Last Solution submitted on Nov 18, 2024

Last 200 Solutions

Problem Comments

1 Comment

1 Comment

Dyuman Joshi on 21 Mar 2022

I am having trouble understanding the concept, for e.g - tril(magic(10)), what I understand is 92+98+81+87+93+76+89+97+78+84=875, which is incorrect acc to the test suite

Solution Comments

Show comments

Problem Recent Solvers100

Problem Tags

Community Treasure Hunt

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

Start Hunting!

Problem 42938. Project Euler: Problem 18, Maximum path sum I

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers100

Suggested Problems

More from this Author2

Problem Tags

Community Treasure Hunt

Problem 42938. Project Euler: Problem 18, Maximum path sum I

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers100

Suggested Problems

More from this Author2

Problem Tags

Community Treasure Hunt

Players