# Find The One

Computer Science Level 2

Is it possible to design an algorithm that uses constant space for the following function?

Input: $$2n + 1$$ non-negative integers; every integer appears twice, except one that appears only once.

Output: The integer that appears exactly once.

×