'''
Given an array of integers in which two elements appear exactly once and all other elements appear exactly twice, find the two elements that appear only once.
'''
# can be done in linear time with hash table, but it requires extra space
# use bit manipulation for linear time and constant space
def single_elements(arr):


assert single_elements([2,4,6,8,10,2,6,10] == [4,8]
