You are given an integer array nums.

Find all integers between the minimum and maximum values in nums (inclusive) that are missing from the array.

Return a list of these missing integers sorted in ascending order.

Constraints:

• $2 \leq$ nums.length $\leq 100$

• $1 \leq$ nums[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.