You are given an integer n and a $0$ indexed integer array costs of length n, where costs[i - 1] represents the cost of landing on step i.

You start at step $0$ and want to reach step n. From any step i, you can jump forward to any step j such that $i < j \le$ n. The cost of making a jump from step i to step j is:

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.