Find the only non-repeating element in an array of pairs
Updated Apr 28, 2026
Short answer
XOR all elements together; pairs cancel out, leaving the unique one.
Deep explanation
This explores bitwise arithmetic and identity properties. XOR all elements together; pairs cancel out, leaving the unique one. These patterns are common in technical coding interviews.
Real-world example
Efficient memory allocation alignment checks.
Common mistakes
- Not handling the case where n = 0 for power-of-two checks.
Follow-up questions
- What is the time complexity?