Given an array of integers, arr, we need to find three indices, i, j, and k, such that $0\leq$ i $<$ j $\leq$ k $<$ arr.length.

We define two values, a and b, as follows:

• a = arr[i] ^ arr[i + 1] ^ ... ^ arr[j - 1]

• b = arr[j] ^ arr[j + 1] ^ ... ^ arr[k]

Note: ^ denotes the bitwise-xor operation.

Return the count of triplets (i, j, k) for which a is equal to b.

Constraints:

• $1 \leq$ arr.length $\leq 300$

• $1 \leq$ arr[i] $\leq 1000$

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.