New update is available. Click here to update.

Single Number III

Posted: 15 Sep, 2020
Difficulty: Moderate


Try Problem

Given an array 'ARR' of integers of size N in which two elements appear exactly once and all other elements appear exactly twice. Your task is to find the two elements that appear only once.

 1. Input will always have only two integers that appear exactly once rest will appear twice.
 2. Try to do this in linear time and constant space.
Input Format:
The first line of input contains an integer N representing the size of the array.

The second line of input contains an N space-separated integers representing the array elements.
Output Format:
Print the two space-separated elements that appear only once where the first integer is less than the second integer.
2 <= N <= 10^5
-10^5 <= ARR[i] <= 10^5

Time Limit: 1 sec