You are given an integer array nums.

An array is called parity alternating if every pair of adjacent elements has different parities (that is, no two adjacent elements are both even or both odd).

In one operation, you can choose any index i and either increase or decrease nums[i] by $1$.

Return an array ans of length $2$ where:

• ans[0] is the minimum number of operations needed to make nums parity alternating.

• ans[1] is the minimum possible value of $\max($nums$) - \min($nums$)$ among all parity alternating arrays achievable using that minimum number of operations.

Constraints:

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

• $-10^9 \leq$ nums[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.