Tap here to switch tabs
Problem
Submissions

Problem: Triangle

Triangle asks you to find the minimum path sum from the top of a number triangle to its bottom, moving only to adjacent values in the next row. Values may be negative.

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 ≤200\leq 200

  • triangle[0].length ==1== 1

  • triangle[i].length == triangle[i - 1].length + 1

  • −104≤-10^4 \leq triangle[i][j] ≤104\leq 10^4

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Triangle

Triangle asks you to find the minimum path sum from the top of a number triangle to its bottom, moving only to adjacent values in the next row. Values may be negative.

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 ≤200\leq 200

  • triangle[0].length ==1== 1

  • triangle[i].length == triangle[i - 1].length + 1

  • −104≤-10^4 \leq triangle[i][j] ≤104\leq 10^4