Given a triangle array, return the minimum path sum from top to bottom. For each step, you may move to an adjacent number of the row below. More formally, if you are on index i on the current row, you may move to either index i or index i + 1 on the

minimumTotal.js

/**
 * @param {number[][]} triangle
 * @return {number}
 */
var minimumTotal = function(triangle) {
    // Start from the second-to-last row and move upward
    for (let row = triangle.length - 2; row >= 0; row--) {
        for (let col = 0; col < triangle[row].length; col++) {
            // For each element, choose the minimum of the two adjacent numbers in the row below
            // and add it to the current element
            triangle[row][col] += Math.min(
                triangle[row + 1][col],     // directly below
                triangle[row + 1][col + 1]  // below and to the right
            );
        }
    }

    // After processing, the top element contains the minimum path sum
    return triangle[0][0];
};