XOR Queries of a Subarray

You are given an array arr of positive integers. You are also given the array queries where queries[i] = [lefti, righti].

For each query i, compute the XOR of elements from lefti to righti, that is, arr[lefti] XOR arr[lefti + 1] XOR ... XOR arr[righti].

Return an array answer where answer[i] is the answer to the i^th query.

Example 1
Inputarr = [1,3,4,8], queries = [[0,1],[1,2],[0,3],[3,3]]
Output[2,7,14,8]
The XOR values for the queries are 1 xor 3 = 2, 3 xor 4 = 7, 1 xor 3 xor 4 xor 8 = 14, and 8.
Example 2
Inputarr = [4,8,2,10], queries = [[2,3],[1,3],[0,0],[0,3]]
Output[8,0,4,4]
Each output value is the XOR of the elements in arr over the corresponding query range.

Constraints

  • 1 <= arr.length, queries.length <= 3 * 10^4
  • 1 <= arr[i] <= 10^9
  • queries[i].length == 2
  • 0 <= lefti <= righti < arr.length

Asked at 4 companies

</>

Your Solution

(Ctrl/Cmd + Enter)

Switching Language

Loading template...

Loading...

Sign in to save your progress

AI code evaluation

Get a correctness verdict, missed edge cases, and complexity analysis of your solution.

Sign in to evaluate