Count Subarrays with Given XOR Problem Statement

You are given an array of integers ARR and an integer X. Your task is to determine the number of subarrays of ARR whose bitwise XOR is equal to X.

Example:

Input:
The first line contains a single integer ‘T’, the number of test cases. Each test case comprises:
1. A line containing two integers N and X.
2. A line with N space-separated integers, the elements of ARR.
Output:
For each test case, output the count of subarrays whose XOR is equal to X, each on a new line.

Constraints:

  • 1 <= T <= 10
  • 3 <= N <= 5 * 10^4
  • 0 <= X <= 10^9
  • 0 <= ARR[i] <= 10^9

Note:

A subarray ‘B’ of an array ‘A’ is derived by deleting elements from the start and/or the end of ‘A’. You need not print anything; the core function should return the results.

AnswerBot
1d

Count the number of subarrays in an array whose XOR is equal to a given value.

  • Iterate through the array and keep track of XOR values and their frequencies using a hashmap.

  • For each element in the array...read more

Help your peers!
Add answer anonymously...
Think Future Technologies Software Developer Interview Questions
Stay ahead in your career. Get AmbitionBox app
qr-code
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+

Reviews

4 L+

Interviews

4 Cr+

Salaries

1 Cr+

Users/Month

Contribute to help millions

Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.

Follow us
  • Youtube
  • Instagram
  • LinkedIn
  • Facebook
  • Twitter