Project Euler Problems 1 to 100 - Problem 18: Maximum path sum I

[JeremyLT]

The solution you wrote doesn’t match the solution posted.

freeCodeCamp Challenge Guide: Problem 18: Maximum path sum I

Problem 18: Maximum path sum I Solutions

Solution 1 (Click to Show/Hide)

function maximumPathSumI(triangle) { // Copy the triangle // Note: not needed if we are ok with mutating the input const triangleCopy = triangle.map(row => [...row]); // Find max path for (let i = triangleCopy.length - 2; i >= 0; i--) { for (let j = 0; j <= i; j++) { triangleCopy[i][j] += Math.max(triangleCopy[i + 1][j], triangleCopy[i + 1][j + 1]); } } return triangleCopy[0][0]; } …

The most recent solution was posted on June 13 and both solutions have used {}s since that day.

The previous version used different whitespace than you posted here. If you use the code as it was originally posted and add {} as the original whitespace indicates, the older version of the solution works fine. The nested loop bodies are single statements.