Project Euler: Problem 18, Maximum path sum I - MATLAB Cody - MATLAB Central

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

Difficulty:
(137)
Rate

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

48.21% Correct | 51.79% Incorrect
Last Solution submitted on Mar 20, 2025

Problem Comments

Solution Comments

Show comments
Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025
...
Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers104

Suggested Problems

More from this Author2

Problem Tags

euler projecteuler

Community Treasure Hunt

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

Start Hunting!
Go to top of page