XOR Query Problem Statement

Assume you initially have an empty array called ARR. You are required to return the updated array after executing Q number of queries on this array.

There are two types of queries to perform:

1 'VAL': Insert integer VAL at the end of the array.

2 'VAL': Perform bitwise XOR on all elements of the array with VAL, i.e., update each element as ARR[i] = ARR[i] ^ VAL (where ^ denotes the bitwise XOR operation).

Example:

Input:

T = 1
Q = 3
1 2
1 3
2 1

Output:

[3, 2]

Explanation:

For the first query, insert 2 into the array resulting in [2]. For the second query, insert 3, resulting in [2, 3]. For the third query, XOR each element by 1, resulting in [3, 2].

Constraints:

1

Question

XOR Query Problem Statement

Assume you initially have an empty array called ARR. You are required to return the updated array after executing Q number of queries on this array.

There are two types of queries to perform:

1 'VAL': Insert integer VAL at the end of the array.
2 'VAL': Perform bitwise XOR on all elements of the array with VAL, i.e., update each element as ARR[i] = ARR[i] ^ VAL (where ^ denotes the bitwise XOR operation).

Example:

Input:

Output:

[3, 2]

Explanation:

For the first query, insert 2 into the array resulting in [2]. For the second query, insert 3, resulting in [2, 3]. For the third query, XOR each element by 1, resulting in [3, 2].

Constraints:

1 <= T <= 10
1 <= Q <= 10^5
1 <= Val <= 10^9
First query will always be a type 1 query.
The array is updated based on the cumulative changes of each query.

Note:

No need to print the output, focus on implementing the function correctly.

Accepted Answer

Implement a function to update an array based on XOR queries.

Create an empty array to store the elements.
Iterate through each query and update the array accordingly.
Use bitwise XOR operation to update the elements.
Ensure to handle both types of queries - insert and XOR.
Return the updated array after all queries are processed.