Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 137. Single Number II
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.