<ul><li>Given a triangle, find the minimum path sum from top to bottom.</li><li>Two approaches to solve the problem: Top Down and Bottom Up.</li><li>Top Down approach: Initialize a result vector with the value of triangle[0][0]. Iterate through the levels and compute the minimum path sum.</li><li>Bottom Up approach: Start from the row above the bottom row. Add the smaller of the two adjacent numbers with the current element. Get the smallest sum to the top.</li></ul>

Given a triangle, find the minimum path sum from top to bottom.

Discover more