Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 120. Triangle
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source