SIEMENS Hiring | Off Campus OA (2021) | Minimum Path Sum in Triangle

Problem Statement Given a triangle array, return the minimum path sum from top to bottom. For each step, you may move to one of the two adjacent numbers in the row immediately below: From position i in the current row, you can move to: Position i in the next row, or Position i + 1 in the next row. Your task is to find the minimum possible sum of values along a path from the top of the triangle to ...