# LeetCode 1310XOR Queries of a Subarray

## LeetCode 1310 XOR Queries of a Subarray Problem

``````class Solution:
def xorQueries(self, arr: List[int], queries: List[List[int]]) -> List[int]:
pref = [0]
# Compute accumulated xor from head
for e in arr:
pref.append(e ^ pref[-1])
ans = []
# query result equal to xor[0, l] xor x[0, r]
for [l, r] in queries:
ans.append(pref[r+1] ^ pref[l])
return ans

# def xorQueries(self, arr: List[int], queries: List[List[int]]) -> List[int]:
#     for i in range(len(arr) - 1):
#         arr[i + 1] ^= arr[i]
#     return [arr[j] ^ arr[i - 1] if i else arr[j] for i, j in queries]
``````
Download XOR Queries of a Subarray.py

## List of all XOR Queries of a Subarray problems

Leetcode 1310 XOR Queries of a Subarray problem solution in python3 with explanation. This is the best place to expand your knowledge and get prepared for your next interview.

Feedback is the most important part of any website.

If you have any query, suggestion or feedback, Please feel free to contact us.