You are given an integer array nums of even length. You need to split nums into two arrays nums1 and nums2 such that:

• nums1.length $=$ nums2.length $=$ nums.length $/ 2$

• nums1 contains only distinct elements.

• nums2 contains only distinct elements.

Return true if it is possible to split the array, and false otherwise.

Constraints:

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

• nums.length $\pmod 2 = 0$

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