{"id":832,"date":"2025-08-04T12:39:38","date_gmt":"2025-08-04T07:09:38","guid":{"rendered":"https:\/\/codeanddebug.in\/blog\/?p=832"},"modified":"2025-08-04T12:39:42","modified_gmt":"2025-08-04T07:09:42","slug":"triangle","status":"publish","type":"post","link":"https:\/\/codeanddebug.in\/blog\/triangle\/","title":{"rendered":"Triangle | Leetcode 120 | All 4 DP Solutions"},"content":{"rendered":"\n

Given a triangle<\/code> array, return the minimum path sum from top to bottom<\/em>.<\/p>\n\n\n\n

For each step, you may move to an adjacent number of the row below. More formally, if you are on index i<\/code> on the current row, you may move to either index i<\/code> or index i + 1<\/code> on the next row.<\/p>\n\n\n\n

Here’s the [Problem Link<\/span><\/mark><\/a><\/strong>] to begin with.<\/p>\n\n\n\n

Example 1:<\/strong><\/p>\n\n\n\n

Input:<\/strong> triangle = [[2],[3,4],[6,5,7],[4,1,8,3]]
Output:<\/strong> 11
Explanation:<\/strong> 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).<\/pre>\n\n\n\n
Example 2:<\/strong><\/p>\n\n\n\n
Input:<\/strong> triangle = [[-10]]
Output:<\/strong> -10<\/pre>\n\n\n\n
Constraints:<\/strong><\/p>\n\n\n\n