Watch 10 video solutions for Find the XOR of Numbers Which Appear Twice, a easy level problem involving Array, Hash Table, Bit Manipulation. This walkthrough by take U forward has 233,991 views views. Want to try solving it yourself? Practice on FleetCode or read the detailed text solution.
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.
Example 1:
Input: nums = [1,2,1,3]
Output: 1
Explanation:
The only number that appears twice in nums is 1.
Example 2:
Input: nums = [1,2,3]
Output: 0
Explanation:
No number appears twice in nums.
Example 3:
Input: nums = [1,2,2,1]
Output: 3
Explanation:
Numbers 1 and 2 appeared twice. 1 XOR 2 == 3.
Constraints:
1 <= nums.length <= 501 <= nums[i] <= 50nums appears either once or twice.