Single Number
Given a non-empty array of integers nums, every element appears twice except for one. Find that single one. You must implement a solution with linear runtime complexity and use only constant extra space.
Single Number

Given a non-empty array of integers nums, every element appears twice except for one. Find that single one. You must implement a solution with linear runtime complexity and use only constant extra space.

Example 1:
Input: [2,2,1]
Output: 1
Input
arr =[2,2,1]

Initialize result = 0. XOR properties: a ^ a = 0, a ^ 0 = a

Input Array
2
2
1
Running XOR Result

0

Binary: 00000000

XOR Properties:

a ^ a = 0 (same numbers cancel out)

a ^ 0 = a (XOR with 0 gives original)

XOR is commutative and associative

Current
Processed
Variables
No variables to display
DepthFunction Call
Stack empty
0/4