You are given an array of non-negative integers nums.

The array nums is considered special if there exists an integer x such that there are exactly x elements in nums that are greater than or equal to x.

Return x if the array is special; otherwise, return $-1$.

Note: The integer x does not necessarily have to be an element in nums.

Constraints:

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

• $0 \leq$ nums[i] $\leq 1000$

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.