LC-1310 Medium LeetCode

1310. XOR Queries of a Subarray

Read the full problem statement on LeetCode.

Difficulty: medium Acceptance: 78% Topics: Array, Bit Manipulation, Prefix Sum

Reading material

Arrays & Hashing 12 min Bit Manipulation 10 min Prefix Sums & Difference Arrays 11 min

Reference solution (spoiler · python)

# Time:  O(n)
# Space: O(1)

class Solution(object):
    def xorQueries(self, arr, queries):
        """
        :type arr: List[int]
        :type queries: List[List[int]]
        :rtype: List[int]
        """
        for i in xrange(1, len(arr)):
            arr[i] ^= arr[i-1]
        return [arr[right] ^ arr[left-1] if left else arr[right] for left, right in queries]

Solution from kamyu104/LeetCode-Solutions · MIT