#1442

Count Triplets That Can Form Two Arrays of Equal XOR

pupil · 400 · lc medium +24 · verified · 84.8% accepted · 2,025 likes · top 96%

Description

Given an integer array arr, find all index triplets (i, j, k) satisfying 0 <= i < j <= k < arr.length.

For each such triplet, define a as the XOR of elements from index i to j-1, and b as the XOR of elements from index j to k.

Return the total count of triplets where a == b.

Example 1:

Input: arr = [2,3,1,6,7]

Output: 4

Explanation: The triplets are (0,1,2), (0,2,2), (2,3,4) and (2,4,4)

Example 2:

Input: arr = [1,1,1,1,1]

Output: 10

Code

1

2

3

class Solution:
    def countTriplets(self, arr: List[int]) -> int:

class Solution:
    def countTriplets(self, arr: List[int]) -> int: