You are given an integer array, cost, where cost[i] represents the cost of stepping onto the $i^{th}$ stair. After paying the cost of the stair you land on, you may climb either one or two steps forward. You may begin your climb from step $0$ or step $1$ without incurring any initial cost.

Return the minimum total cost required to reach the position just beyond the last stair (the “top”).

Constraints:

• $2 \leq$ cost.length $\leq 1000$

• $0 \leq$ cost[i] $\leq 999$

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.