Dsa
Bit Manipulation
Hard
Single Number with Odd Bits
Given an array of integers where each integer appears twice except for one integer which appears an odd number of times, find that integer. Your function should read the array and output the integer that appears an odd number of times.
Example:
Input:
[2, 2, 3, 3, 3, 7, 7]
Output:
3
Explanation: The integer 3 appears three times, which is odd.
Key concepts
bit_manipulationfinding_unique
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