Given an integer array nums and two integers target1 and target2, find the number of ways to partition nums into one or more contiguous non empty subarrays such that the bitwise XOR sum of the elements in each subarray alternates between target1 and target2.

Specifically, the partition must satisfy the following conditions:

• The first subarray has a bitwise XOR sum equal to target1.

• The second subarray, if present, has a bitwise XOR sum equal to target2.

• The third subarray, if present, has a bitwise XOR sum equal to target1, and the values continue alternating in this pattern for all subsequent subarrays.

Return the total number of valid alternating XOR partitions.

Constraints:

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

• $0 \leq$ nums[i], target1, target2 $\leq 10^5$

• target1 $\neq$ target2

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.