You are given an integer array nums and an integer k.

An integer h is considered valid if all elements in nums that are strictly greater than h are equal to each other.

In one operation, you can:

• Select a valid integer h.

• Change every element in nums that is strictly greater than h to h.

Return the minimum number of operations required to make all elements in nums equal to k, or $-1$ if it is impossible to do so.

Constraints:

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

• $1 \leq$ nums[i] $\leq 100$

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