LeetCode

I came across the following array questions on LeetCode and was amazed by one of the solutions achieving a linear runtime complexity and without using extra memory. Given a non-empty array of integers nums, every element appears twice except for one. Find that single one.