Single Number 3 | LeetCode-260 | Bit Manipulation| Adobe, Amazon, Facebook, Yahoo Interview question

Опубликовано: 10 Март 2026
на канале: swadhyayedu

6,131

312

Problem Statement -

Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.

Example:

Input: [1,2,1,3,2,5]
Output: [3,5]
Note:

The order of the result is not important. So in the above example, [5, 3] is also correct.
Your algorithm should run in linear runtime complexity. Could you implement it using only constant space complexity?

Also check out our other videos :

Single number 2 - Bit Manipulation :    • Single Number 2-Bit manipulation LeetCode ...

Single number 2- Hashmap solution :    • Single Number 2- LeetCode 137 | Coding pro...

Single number 1 - Bit manipulation :    • Single Number 1-Bit Manipulation (Solution...

Single number 1 - Hashmap solution :    • Single Number 1 - HashMap Solution || Leet...

Number Swapper :    • Swap Two Numbers Without Using third (temp...

Frequently asked JavaScript interview questions- part 1:    • Top 5 JavaScript Interview Questions | Mos...

Follow us on instagram :
  / codegeekslab

  / swadhyayedu

Like our facebook page :

  / codegeekslab-100101071766280