How would you solve this problem: Given an array where every number appears twice except for two numbers that appear once, how can I find the two unique numbers in O(n) time and O(1) space? Any ideas?

[gitBurned-cmd]