Given an integer array nums, let $x$ be the smallest distinct value present in nums.

Find the smallest distinct value $y$ in nums such that $y > x$ and the frequency of occurrence of $y$ in nums is not equal to the frequency of occurrence of $x$ in nums.

Return an array containing $[x, y]$. If no such value $y$ exists, return $[-1, -1]$.

Constraints:

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