Leetcode 120. Triangle

Find the minimum sum path from the top to the bottom of a triangular array where at each step you may move to one of the two adjacent numbers in the row below (indices i or i+1). This is a classic dynamic programming problem (can be solved top-down or bottom-up) with a follow-up to optimize space to O(n) where n is the number of rows.