Count Triplets That Can Form Two Arrays of Equal XOR.java

// Runtime: 2 ms (Top 85.89%) | Memory: 41.5 MB (Top 67.63%)
class Solution {
    public int countTriplets(int[] arr) {
        int count=0;

        for(int i=0;i<arr.length;i++){
            int val=0;
            val=val^arr[i];
            for(int k=i+1;k<arr.length;k++){
                val=val ^ arr[k];
                if(val==0) count+=k-i;
            }
        }
        return count;
    }
}