You are given an integer array nums consisting of $2 imes n$ integers.

You need to divide nums into $n$ pairs such that each element belongs to exactly one pair and both elements in each pair are equal.

Return true if nums can be divided into such pairs, or false otherwise.

Constraints:

• nums.length $= 2 imes n$

• $1 \leq n \leq 500$

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

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.