Round 1
Questions:
Given a triangle array, return the minimum path sum from top to bottom.
For each step, you may move to an adjacent number of the row below. More formally, if you are on index i on the current row, you may move to either index i or index i + 1 on the next row.
Example 1:
Input: triangle = [[2],[3,4],[6,5,7],[4,1,8,3]] Output: 11
Explanation: The triangle looks like:
2 3 4 6 5 7 4 1 8 3
The minimum path sum from top to bottom is 2 + 3 + 5 + 1 = 11 (underlined above).
Example 2:
Input: triangle = [[-10]] Output: -10
Candidate's Approach
The candidate implemented a dynamic programming solution using a 2D array dp to store the minimum path sums. The algorithm iterates from the bottom of the triangle to the top, updating the dp array based on the minimum sums of adjacent numbers in the row below. The final result is stored in dp[0][0].
Interviewer's Feedback
No feedback provided.