Problem
Ask
Submissions

Problem: Single Number II

Medium
30 min
Explore how to use bitwise manipulation to find two elements that appear once in an array while all others appear twice. Learn to solve this problem efficiently using constant extra space and improve your algorithm skills with coding practice.

Statement

Given a non-empty array arr, in which exactly two elements appear once, and all the other elements appear twice, return the two elements that appeared only once.

Note: The result can be returned in any order. The solution should use only constant extra space.

Constraints:

  • 2≤2 \leq arr.length ≤103\leq 10^3

  • −231≤−2^{31} \leq arr[i] ≤231−1\leq 2^{31}-1

Similar Problems
Power of Two
Find the Difference
Complement of Base 10 Integer
Flipping an Image
Single Number
Encode and Decode Strings
Reverse Bits
Find the Longest Substring Having Vowels in Even Counts
Longest Subarray With Maximum Bitwise AND
Count Triplets That Can Form Two Arrays of Equal XOR
⋮
Problem
Ask
Submissions

Problem: Single Number II

Medium
30 min
Explore how to use bitwise manipulation to find two elements that appear once in an array while all others appear twice. Learn to solve this problem efficiently using constant extra space and improve your algorithm skills with coding practice.

Statement

Given a non-empty array arr, in which exactly two elements appear once, and all the other elements appear twice, return the two elements that appeared only once.

Note: The result can be returned in any order. The solution should use only constant extra space.

Constraints:

  • 2≤2 \leq arr.length ≤103\leq 10^3

  • −231≤−2^{31} \leq arr[i] ≤231−1\leq 2^{31}-1

Similar Problems
Power of Two
Find the Difference
Complement of Base 10 Integer
Flipping an Image
Single Number
Encode and Decode Strings
Reverse Bits
Find the Longest Substring Having Vowels in Even Counts
Longest Subarray With Maximum Bitwise AND
Count Triplets That Can Form Two Arrays of Equal XOR