## Similar Problems

Similar Problems not available

# Triangle - Leetcode Solution

## Companies:

LeetCode: Triangle Leetcode Solution

Difficulty: Medium

Topics: dynamic-programming array

As an AI language model, I don't have access to specific problems on LeetCode and their details. However, I can provide a general approach/solution to a triangle problem based on the information you provide.

A typical triangle problem on LeetCode could be finding the minimum sum of a path from the top of the triangle to the bottom. The input could be a list of lists where each sublist represents a row of the triangle, and the values in the sublists represent the nodes' values.

To solve this problem, you can use dynamic programming to find the minimum sum for each node in the triangle. You start at the bottom row and work your way up. For each node in the row, you add the minimum sum of its two adjacent nodes in the row below. By the time you reach the top, the minimum sum of the path from the top to bottom would be the minimum sum of the nodes in the top row.

Here is the general code to solve the problem:

```
tri = [[2], [3,4], [6,5,7],[4,1,8,3]]
for i in range(len(tri)-2, -1, -1):
for j in range(len(tri[i])):
tri[i][j] += min(tri[i+1][j], tri[i+1][j+1])
return tri[0][0]
```

In the above code, we iterate from the second last row to the first row of the triangle using two nested loops. For each node in the current row, we add the minimum sum of its two child nodes in the row below. Finally, we return the minimum sum of the top node, which would be the minimum sum of the path from the top to the bottom of the triangle.

Note: the above code is a general approach to solve a typical triangle problem on LeetCode. For more specific solutions, the problem description on LeetCode should be consulted.

## Triangle Solution Code

`1`