Given a non-empty array of integers `nums`, every element appears twice except for one. Find that single one. You must implement a solution with a linear runtime complexity and use only constant extra space.
Bit Manipulation (XOR)
The XOR operation has two key properties: (1) `x ^ x = 0` (any number XORed with itself is 0) and (2) `x ^ 0 = x` (any number XORed with 0 is itself). By XORing all numbers in the array together, all pairs will cancel each other out to 0, leaving only the single unique number.