Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in JavaScript

Solution: Triangle

Explore how to apply dynamic programming to find the minimum path sum in a triangle array. Understand the bottom-up strategy that builds optimal solutions from the last row upward, reducing time complexity and avoiding redundant calculations.

We'll cover the following...

Statement

Given an array, triangle, return the minimum path sum from top to bottom.

You may move to an adjacent number in the row below at each step. More formally, if you are at index ii in the current row, you may move to either index ii or index i+1i + 1 in the next row.

Constraints:

  • 1≤1 \leq triangle.length ...