bit_manipulation.find_unique_number

Functions

find_unique_number(→ int)

Given a list of integers where every element appears twice except for one,

Module Contents

bit_manipulation.find_unique_number.find_unique_number(arr: list[int]) → int

Given a list of integers where every element appears twice except for one, this function returns the element that appears only once using bitwise XOR.

>>> find_unique_number([1, 1, 2, 2, 3])
3
>>> find_unique_number([4, 5, 4, 6, 6])
5
>>> find_unique_number([7])
7
>>> find_unique_number([10, 20, 10])
20
>>> find_unique_number([])
Traceback (most recent call last):
    ...
ValueError: input list must not be empty
>>> find_unique_number([1, 'a', 1])
Traceback (most recent call last):
    ...
TypeError: all elements must be integers