Given an integer array nums, determine whether it is special.

An array is considered special if every pair of adjacent elements nums[i] and nums[i+1] has different parity, meaning one is even and the other is odd.

Return true if nums is special, otherwise return false.

Note: If nums contains only one element, it is special.

Constraints:

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

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

Input: nums = [7]-List[int]
Output: true-bool
Explanation: A single-element array is always special since there are no adjacent pairs to compare.

Input: nums = [8, 3, 10, 5, 12, 9]-List[int]
Output: true-bool
Explanation: Each adjacent pair alternates parity: 8 (even) vs 3 (odd), 3 (odd) vs 10 (even), 10 (even) vs 5 (odd), 5 (odd) vs 12 (even), and 12 (even) vs 9 (odd).

Input: nums = [6, 2, 9, 4]-List[int]
Output: false-bool
Explanation: The first adjacent pair, 6 and 2, are both even, so the array is not special.

Input: nums = [1, 3, 5, 7, 9]-List[int]
Output: false-bool
Explanation: All numbers are odd, so every adjacent pair has the same parity (odd/odd), violating the condition.

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.