<filename>find-the-non-duplicate-number/solution.py<gh_stars>0
# Given a list of numbers, where every number shows up twice except for one number, find that one number.

# Example:
# Input: [4, 3, 2, 4, 1, 3, 2]
# Output: 1
# Here's the function signature:

def singleNumber(nums):
  n = sorted(nums)
  for i in range(0,len(n) - 1):
    if n[i] != n[i+1]:
      return n[i]
        

print(singleNumber([4, 3, 2, 4, 1, 3, 2]))
# 1

# Challenge: Find a way to do this using O(1) memory.