Given an array nums of distinct integers, determine the minimum number of adjacent swaps required to rearrange the array such that the parity of the elements alternates throughout the array.

An array has alternating parity if no two adjacent elements have the same parity.

Return the minimum number of adjacent swaps needed to achieve this configuration, or return $-1$ if it is impossible.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• $1 \leq$ nums[i] $\leq 10^9$

• All elements in nums are distinct.

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.