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
| Name | Name | Last commit date | ||
|---|---|---|---|---|
parent directory.. | ||||
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