You are given an array of distinct integers nums1 of length n.

You want to construct an array nums2 of length n. For each index i from $0$ to n - 1, you can choose either:

• nums2[i] = nums1[i]

• nums2[i] = nums1[i] - nums1[j] for some index j such that $0 \leq j < n$ and $j \neq i$

Return true if it is possible to create an array nums2 such that all its elements have the same parity (all even or all odd), and false otherwise.

Constraints:

• $1 \leq$ n $==$ nums1.length $\leq 100$

• $1 \leq$ nums1[i] $\leq 100$

• nums1 consists of distinct integers.

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.