Short Problem Definition:
There are N integers in an array A. All but one integer occur in pairs. Your task is to find out the number that occurs only once.
time complexity is O(N);
space complexity is O(1)
XORing two equal numbers cancels them out. XOR all numbers together.