Tap here to switch tabs
Problem
Submissions

Problem: Count Triplets That Can Form Two Arrays of Equal XOR

Count Triplets That Can Form Two Arrays of Equal XOR asks you to count index triplets in an integer array that split a contiguous range into two adjacent nonempty parts with equal bitwise XOR.

Statement

Given an array of integers, arr, we need to find three indices, i, j, and k, such that 0≤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≤1 \leq arr.length ≤300\leq 300

  • 1≤1 \leq arr[i] ≤1000\leq 1000

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Count Triplets That Can Form Two Arrays of Equal XOR

Count Triplets That Can Form Two Arrays of Equal XOR asks you to count index triplets in an integer array that split a contiguous range into two adjacent nonempty parts with equal bitwise XOR.

Statement

Given an array of integers, arr, we need to find three indices, i, j, and k, such that 0≤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≤1 \leq arr.length ≤300\leq 300

  • 1≤1 \leq arr[i] ≤1000\leq 1000