René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/triangle","name":"#120 - Triangle - LeetCode JavaScript Solutions","description":"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. ...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[][]} triangle\n * @return {number}\n */\nvar minimumTotal = function(triangle) {\n  for (let i = triangle.length - 2; i > -1; i--) {\n    for (let j = 0; j < triangle[i].length; j++) {\n      triangle[i][j] += Math.min( triangle[i + 1][j], triangle[i + 1][j + 1]);\n    }\n  }\n\n  return triangle[0][0];\n};","keywords":"LeetCode 120, #120 - Triangle, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}