Triangle- Leetcode 120 [Medium]

Problem Link:

https://leetcode.com/problems/triangle/

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

Solution

If you are at an index “i” in a row, you can move to index “i” or index “i+1” in the next row. So, the minimum value for an index “i” in a row can be obtained by considering index “i-1” or index “i” from the previous row. So, the original triangle matrix is modified top down considering the minimum values from the previous row. Finally, we return the minimum value from the last row.