You are given two $0$ indexed integer arrays, nums1 and nums2, each having an even length n.

You must remove $n / 2$ elements from nums1 and $n / 2$ elements from nums2. After the removals, all remaining elements from both arrays are placed into a set s.

Return the maximum possible number of elements in the set s.

Constraints:

• n == nums1.length == nums2.length

• $1 \leq$ n $\leq 2 imes 10^4$

• n is even.

• $1 \leq$ nums1[i], nums2[i] $\leq 10^9$

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.