Given an array, triangle, return the minimum path sum from top to bottom.

You may move to an adjacent number in the row below at each step. More formally, if you are at index $i$ in the current row, you may move to either index $i$ or index $i + 1$ in the next row.

Constraints:

• $1 \leq$ triangle.length $\leq 200$

• triangle[0].length $== 1$

• triangle[i].length $=$ triangle[i - 1].length + 1

• $-10^4 \leq$ triangle[i][j] $\leq 10^4$

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.