Dsa
Bit Manipulation
Easy
XOR of All Unique Elements
Given an integer list with some elements appearing twice and others once, write a program to compute the XOR of all unique elements. The input consists of a single line containing space-separated integers. Print the resulting integer from the XOR operation.
Example:
Input:
1 2 2 3 3 4
Output:
4
Key concepts
bit_manipulationxor
Practise this out loud — free
Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.
🎙 Practise this question now