Count Triplets That Can Form Two Arrays of Equal XOR LeetCode solution in Java

1
class Solution {
2
  public int countTriplets(int[] arr) {
3
    int count = 0;
4

5
    for (int i = 0; i < arr.length; i++) {
6
      int val = 0;
7
      val = val ^ arr[i];
8
      for (int k = i + 1; k < arr.length; k++) {
9
        val = val ^ arr[k];
10
        if (val == 0) count += k - i;
11
      }
12
    }
13
    return count;
14
  }
15
}