Grokking the Coding Interview Patterns in Go/

...

/

Solution: Triangle

Solution: Triangle

Let’s solve the Triangle problem using the Dynamic Programming pattern.

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 ...