Given a sorted integer array nums and an integer n, return the minimum number of elements that must be added to the array such that every number in the range $[1, n]$ inclusive can be formed by the sum of a subset of elements from nums.

Constraints:

• $1 \leq$ nums.length $\leq 1000$

• $1 \leq$ nums[i] $\leq 10^4$

• nums is sorted in ascending order.

• $1 \leq$ n $\leq 2^{31} - 1$

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.