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$

The naive approach to solve this problem is to exhaustively iterate through every possible triplet (i, j, k) and check if the XOR of the subarrays (i, j-1) and (j, k) is equal. This approach has a time complexity of $O(n^3)$ and a space complexity of $O(1$ ...