Problem Description
Given an array of integers A and an integer B.
Find the total number of subarrays having bitwise XOR of all elements equals to B.
1 <= length of the array <= 105
1 <= A[i], B <= 109
The first argument given is the integer array A.
The second argument given is integer B.
Return the total number of subarrays having bitwise XOR equals to B.
Input 1:
A = [4, 2, 2, 6, 4] B = 6
Input 2:
A = [5, 6, 7, 8, 9] B = 5
Output 1:
4
Output 2:
2
Explanation 1:
The subarrays having XOR of their elements as 6 are: [4, 2], [4, 2, 2, 6, 4], [2, 2, 6], [6]
Explanation 2:
The subarrays having XOR of their elements as 5 are [5] and [5, 6, 7, 8, 9]
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a question? Checkout Sample Codes for more details.
1 Million +
Strong Tech Community500 +
Questions to Practice100 +
Expert Interview Guides
