https://leetcode.com/problems/single-number/
class Solution {
public:
int singleNumber(vector<int>& nums) {
int finder = 0;
for(int i = 0; i < nums.size(); i++) {
finder = finder ^ nums[i];
}
return finder;
}
};