Practice Triangle
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
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.
Source: Triangle on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
triangle = [[2],[3,4],[6,5,7],[4,1,8,3]]
Output
11
# Example 2
Input
triangle = [[-10]]
Output
-10
Constraints
1 <= triangle.length <= 200
triangle[0].length == 1
triangle[i].length == triangle[i - 1].length + 1
-10^4 <= triangle[i][j] <= 10^4
Related LeetCode Problems
Practice more problems similar to Triangle.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.