Leetcode 260. Single Number III

Given an array where every number appears twice except for two distinct numbers, find the two unique numbers in O(n) time and O(1) extra space by using bitwise XOR to identify a differing bit and partition numbers into two groups.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 260. Single Number III

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact