Find the Unique Number
easySave
ArrayBit Manipulation
Given an array of integers where every number appears twice except for one, find and return the unique number that does not appear twice.
Example 1
Input
[ 2, 3, 2, 4, 4 ]
Output
3
Explanation. In the array, every number except for 3 appears twice. Therefore, the output is 3.
Example 2
Input
[ 7, 7, 6 ]
Output
6
Explanation. In the array, every number except for 6 appears twice. Thus, 6 is returned.
Example 3
Input
[ 22, 22, 33, 45, 45 ]
Output
33
Explanation. 33 is the number appearing only once while all others appear twice.
Example 4
Input
[ 0, 1, 1 ]
Output
0
Explanation. 0 is the unique number as all other numbers appear twice.
Example 5
Input
[ 11, 11, 88, 99, 88, 77, 77 ]
Output
99
Explanation. 99 is the unique among the numbers, appearing only once.
Follow-up: Can this problem be solved in a more efficient use of space?
Constraints:
The input array should contain at least one element and a maximum of 100 elements. All numbers will be integers.
- Views
- 1