Medium
Quiz
#120 Triangle
APPROACH
Given a triangle array, find and return the minimum path sum from the top to the bottom.
At each step, from index i in the current row you may move to index i or index i + 1 in the next row.
Example 1:
Input: triangle = [[2],[3,4],[6,5,7],[4,1,8,3]]
Output: 11
Explanation: The triangle looks like:
2
3 4
6 5 7
4 1 8 3
The minimum path sum from top to bottom is 2 + 3 + 5 + 1 = 11 (underlined above).
Example 2:
Input: triangle = [[-10]]
Output: -10
1 of 4
1:00
What is the optimal approach for this problem?