Given a $0$ indexed integer array coins representing the values of available coins, and an integer target, determine the minimum number of coins of any value that must be added to the array such that every integer from $1$ to target inclusive can be formed as the sum of a subset of elements in coins.

Constraints:

• $1 \leq$ target $\leq 10^5$

• $1 \leq$ coins.length $\leq 10^5$

• $1 \leq$ coins[i] $\leq$ target

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.