Dsa
Bit Manipulation
Medium
Find Unique Number
In an array, every number appears twice except for one number which appears once. Write a program to find that unique number using bit manipulation. Assume the input is non-empty and only contains valid integers.
Example:
Input:
2 2 3 4 4 5 3
Output:
5
Key concepts
bit_manipulationunique
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