3158. Find the XOR of Numbers Which Appear Twice

LeetCodeArrayHash TableBit ManipulationOpen on judge ↗

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

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI