Find the XOR of Numbers Which Appear Twice

You are given an array nums, where each number in the array appears either once or twice. Return the bitwise XOR of all the numbers that appear twice in the array, or 0 if no number appears twice. LeetCode Problem - 3158 import java.util.HashMap; imp...