You are given an integer array nums of length $2 \times n$. The array contains exactly $n + 1$ unique values. Of these unique values, $n$ of them appear exactly once, and the remaining one appears exactly $n$ times.

Return the element that is repeated $n$ times.

Constraints:

• $2 \leq$ n $\leq 5000$

• nums.length $== 2 \times$ n

• $0 \leq$ nums[i] $\leq 10^4$

• nums contains $n + 1$ unique elements, and exactly one of them is repeated $n$ times

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.