Given an integer array nums, find the maximum length of a contiguous subarray that satisfies the following two conditions:

1. The bitwise XOR sum of all elements in the subarray is equal to $0$.

2. The subarray contains an equal count of even numbers and odd numbers.

Return the maximum length of such a subarray. If no such subarray exists, return $0$.

Constraints:

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

• $0 \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.