136. Single Number

Total Accepted: 123186 Total Submissions: 249218 Difficulty: Medium

Given an array of integers, every element appears twice except for one. Find that single one.

Note:
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?

Subscribe to see which companies asked this question

Code:

int singleNumber(int* nums, int numsSize) {
    int a = 0;
    for(int i = 0;i<numsSize;i++)
        a^=nums[i];
    return a;
}