LeetCode 136: https://leetcode.com/problems/single-number/

test.java

public int singleNumber(int[] nums) {
    int xor = 0;

    for (int i = 0; i < nums.length; i++) {
        xor = xor ^ nums[i];
    }
    return xor;
}