Available question text
Given an array where every element appears exactly three times except one that appears once, identify that unique element in O(n) time and O(1) extra space—typically by aggregating per-bit counts modulo 3 or using an equivalent bitwise state machine.
Related questions
Continue with questions that share topics or the same question type.
- Biggest Single Number
Coding
- Number of Single Divisor Triplets
Coding
- Single Number
Coding · Array · Bit Manipulation
- Single Number III
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 137. Single Number II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source