Every element appears exactly three times except one, which appears once. Find it in O(n) time and O(1) space.
Input: one line of space-separated integers. Output: the single number.
2 2 3 2
3
0 1 0 1 0 1 99
99
Run your code against the sample tests, or Submit to run the full suite.