You are given an array of positive integers arr and an array queries where each query is represented as queries[i] = [left_i, right_i].

For each query i, compute the bitwise XOR of all elements from index left_i to right_i inclusive (that is, arr[left_i] ^ arr[left_i + 1] ^ ... ^ arr[right_i]).

Return an array containing the results of all queries in the given order.

Constraints:

• $1 \leq$ arr.length, queries.length $\leq 3 \times 10^4$

• $1 \leq$ arr[i] $\leq 10^9$

• queries[i].length $= 2$

• $0 \leq left_i \leq right_i <$ arr.length

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.