Dsa
Bit Manipulation
Medium
Find Unique Number in Triplet Array
You are given an array of integers where every integer appears exactly three times, except for one integer which appears exactly once. Your task is to find and return that unique integer.
For example:
Input:
[2, 2, 3, 2]
Output:
3
Explanation: In the array, '2' appears three times and '3' appears once.
Key concepts
bit manipulationunique elements
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