Single Number — October 11, 2026
Given a nonempty array of integers, every element appears twice except for one. Find that single one. Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory? Examples: Input: [2,2,1] Output: 1 Input: [4,1,2,1,2] Output: 4
