How do I find the number that appears only once in an array of size n that has numbers that can appear multiple times?
How do I write an algorithm to search an array to make sure that all of its values appear at least twice?