You are given an integer array cost of length n.

You want to reach every target position i from $0$ to n $- 1$. To reach position i, you may choose any index j such that $0 \leq j \leq i$ and pay cost[j].

Return an integer array ans of length n, where ans[i] is the minimum cost required to reach position i.

Constraints:

• $1 \leq$ n $==$ cost.length $\leq 100$

• $1 \leq$ cost[i] $\leq 100$

Now, 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.