#N136. Single Number
problem link

#solution

class Solution {
    public int singleNumber(int[] nums) {
        int ans = 0;
        int len = nums.length;
        for(int i = 0; i != len; i++)
            ans ^= nums[i];
        
        return ans;

    }
}

p.s. good problem to understand XOR operator better)