You are given an array nums of positive integers and an integer k.

In one operation, you can remove the last element of the array and add it to your collection.

Return the minimum number of operations required to collect all integers from $1$ to k.

Constraints:

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

• $1 \leq$ nums[i] $\leq$ nums.length

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

• The input is generated such that you can collect elements $1, 2, \dots,$ k.

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.