# Odd  Man  Out

## Problem

Find the single unique integer in a list of integers where every other integer
occurs exactly twice. The integers can appear in any order.

For some reason hash tables may not be used in the solution.

For example:

    1, -7, 5, -7 -3, 5, 1 => 3

## Source:

http://courses.csail.mit.edu/iap/interview/Hacking_a_Google_Interview_Practice_Questions_Person_B.pdf

Write a read me for the odd man out problem
Write a read me for the odd man out problem
