You are given an integer array nums. The uniqueness array of nums is a collection containing the number of distinct elements present in every non empty contiguous subarray of nums, sorted in ascending order.

Return the median of the uniqueness array of nums.

Note: The median of an array of size $k$ is the element located at index $\lfloor (k - 1) / 2 \rfloor$ when sorted in nondecreasing order using $0$ based indexing.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• $1 \leq$ nums[i] $\leq 10^5$

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.