LC-2425 Medium LeetCode

2425. Bitwise XOR of All Pairings

Read the full problem statement on LeetCode.

Difficulty: medium Acceptance: 67% Topics: Array, Bit Manipulation, Brainteaser

Reading material

Arrays & Hashing 12 min Bit Manipulation 10 min Game Theory 11 min

Reference solution (spoiler · python)

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

import operator


# bit manipulation
class Solution(object):
    def xorAllNums(self, nums1, nums2):
        """
        :type nums1: List[int]
        :type nums2: List[int]
        :rtype: int
        """
        return (reduce(operator.xor, nums1) if len(nums2)%2 else 0) ^ \
               (reduce(operator.xor, nums2) if len(nums1)%2 else 0)

Solution from kamyu104/LeetCode-Solutions · MIT