LC-3158 Easy LeetCode

3158. Find the XOR of Numbers Which Appear Twice

Read the full problem statement on LeetCode.

Difficulty: easy Acceptance: 78% Topics: Array, Hash Table, Bit Manipulation

Reading material

Arrays & Hashing 12 min Bit Manipulation 10 min

Reference solution (spoiler · python)

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

# hash table
class Solution(object):
    def duplicateNumbersXOR(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        return reduce(lambda x, y: x^y, nums, 0)^reduce(lambda x, y: x^y, set(nums), 0)


# Time:  O(n)
# Space: O(n)
import collections


# freq table
class Solution2(object):
    def duplicateNumbersXOR(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        return reduce(lambda x, y: x^y, (x for x, c in collections.Counter(nums).iteritems() if c == 2), 0)

Solution from kamyu104/LeetCode-Solutions · MIT