Every element appears twice except one. Find that single one using O(n) time and O(1) space. Variant **#45**.
Example 1
Input: nums = [2,2,3,4,4,5,5,3]
Output: 0
Constraints
Acceptance: 73% · Topics: bit-manipulation, array
← All practice problems