Day 23 of July LeetCode Challenge

Aanchal Patial
1 min readJul 23, 2020

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.


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


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



Aanchal Patial

We never really grow up, we only learn how to act in public