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

1
/**
2
* @param {number[]} arr
3
* @return {number}
4
*/
5
var countTriplets = function (arr) {
6
let count = 0;
7
for (let i = 0; i < arr.length; i++) {
8
let xor = arr[i];
9
for (let j = i + 1; j < arr.length; j++) {
10
xor ^= arr[j];
11
if (xor == 0) {
12
count += j - i;
13
}
14
}
15
}
16
return count;
17
};

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0