# Find the two non-repeating elements in an array of repeating elements

Asked by SG

Given an array in which all numbers except two are repeated once. (i.e. we have 2n+2 numbers and n numbers are occurring twice and remaining two have occurred once). Find those two numbers in the most efficient way.

**Method 1(Use Sorting)**

First, sort all the elements. In the sorted array, by comparing adjacent elements we can easily get the non-repeating elements. Time complexity of this method is O(nLogn)

**Method 2(Use XOR)**

Let x and y be the non-repeating elements we are looking for and arr[] be the input array. First, calculate the XOR of all the array elements.

xor = arr[0]^arr[1]^arr[2].....arr[n-1]

All the bits that are set in xor will be set in one non-repeating element (x or y) and not in others. So if we take any set bit of xor and divide the elements of the array in two sets – one set of elements with same bit set and another set with same bit not set. By doing so, we will get x in one set and y in another set. Now if we do XOR of all the elements in the first set, we will get the first non-repeating element, and by doing same in other sets we will get the second non-repeating element.

Let us see an example. arr[] = {2, 4, 7, 9, 2, 4} 1) Get the XOR of all the elements. xor = 2^4^7^9^2^4 = 14 (1110) 2) Get a number which has only one set bit of the xor. Since we can easily get the rightmost set bit, let us use it. set_bit_no = xor & ~(xor-1) = (1110) & ~(1101) = 0010 Now set_bit_no will have only set as rightmost set bit of xor. 3) Now divide the elements in two sets and do xor of elements in each set and we get the non-repeating elements 7 and 9. Please see the implementation for this step.

**Implementation:**

## C++

`#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `/* This finction sets the values of ` `*x and *y to nonr-epeating elements ` `in an array arr[] of size n*/` `void` `get2NonRepeatingNos(` `int` `arr[], ` `int` `n, ` `int` `*x, ` `int` `*y) ` `{ ` ` ` `int` `Xor = arr[0]; ` `/* Will hold Xor of all elements */` ` ` `int` `set_bit_no; ` `/* Will have only single set bit of Xor */` ` ` `int` `i; ` ` ` `*x = 0; ` ` ` `*y = 0; ` ` ` ` ` `/* Get the Xor of all elements */` ` ` `for` `(i = 1; i < n; i++) ` ` ` `Xor ^= arr[i]; ` ` ` ` ` `/* Get the rightmost set bit in set_bit_no */` ` ` `set_bit_no = Xor & ~(Xor-1); ` ` ` ` ` `/* Now divide elements in two sets by comparing rightmost set ` ` ` `bit of Xor with bit at same position in each element. */` ` ` `for` `(i = 0; i < n; i++) ` ` ` `{ ` ` ` `if` `(arr[i] & set_bit_no) ` ` ` `*x = *x ^ arr[i]; ` `/*Xor of first set */` ` ` `else` ` ` `*y = *y ^ arr[i]; ` `/*Xor of second set*/` ` ` `} ` `} ` ` ` `/* Driver code */` `int` `main() ` `{ ` ` ` `int` `arr[] = {2, 3, 7, 9, 11, 2, 3, 11}; ` ` ` `int` `n = ` `sizeof` `(arr)/` `sizeof` `(*arr); ` ` ` `int` `*x = ` `new` `int` `[(` `sizeof` `(` `int` `))]; ` ` ` `int` `*y = ` `new` `int` `[(` `sizeof` `(` `int` `))]; ` ` ` `get2NonRepeatingNos(arr, n, x, y); ` ` ` `cout<<` `"The non-repeating elements are "` `<<*x<<` `" and "` `<<*y; ` `} ` ` ` `// This code is contributed by rathbhupendra ` |

*chevron_right*

*filter_none*

## C

`#include <stdio.h> ` `#include <stdlib.h> ` ` ` `/* This finction sets the values of *x and *y to nonr-epeating ` ` ` `elements in an array arr[] of size n*/` `void` `get2NonRepeatingNos(` `int` `arr[], ` `int` `n, ` `int` `*x, ` `int` `*y) ` `{ ` ` ` `int` `xor = arr[0]; ` `/* Will hold xor of all elements */` ` ` `int` `set_bit_no; ` `/* Will have only single set bit of xor */` ` ` `int` `i; ` ` ` `*x = 0; ` ` ` `*y = 0; ` ` ` ` ` `/* Get the xor of all elements */` ` ` `for` `(i = 1; i < n; i++) ` ` ` `xor ^= arr[i]; ` ` ` ` ` `/* Get the rightmost set bit in set_bit_no */` ` ` `set_bit_no = xor & ~(xor-1); ` ` ` ` ` `/* Now divide elements in two sets by comparing rightmost set ` ` ` `bit of xor with bit at same position in each element. */` ` ` `for` `(i = 0; i < n; i++) ` ` ` `{ ` ` ` `if` `(arr[i] & set_bit_no) ` ` ` `*x = *x ^ arr[i]; ` `/*XOR of first set */` ` ` `else` ` ` `*y = *y ^ arr[i]; ` `/*XOR of second set*/` ` ` `} ` `} ` ` ` `/* Driver program to test above function */` `int` `main() ` `{ ` ` ` `int` `arr[] = {2, 3, 7, 9, 11, 2, 3, 11}; ` ` ` `int` `*x = (` `int` `*)` `malloc` `(` `sizeof` `(` `int` `)); ` ` ` `int` `*y = (` `int` `*)` `malloc` `(` `sizeof` `(` `int` `)); ` ` ` `get2NonRepeatingNos(arr, 8, x, y); ` ` ` `printf` `(` `"The non-repeating elements are %d and %d"` `, *x, *y); ` ` ` `getchar` `(); ` `} ` |

*chevron_right*

*filter_none*

**Output:**

The non-repeating elements are 7 and 9

**Time Complexity: **O(n)

**Auxiliary Space:** O(1)

Please refer below post for detailed explanation :

Find the two numbers with odd occurrences in an unsorted array

Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: **DSA Self Paced**. Become industry ready at a student-friendly price.

## Recommended Posts:

- Find the two repeating elements in a given array
- Find all elements in array which have at-least two greater elements
- Find elements of array using XOR of consecutive elements
- Rearrange array elements such that Bitwise AND of first N - 1 elements is equal to last element
- Find four elements a, b, c and d in an array such that a+b = c+d
- Find XOR of all elements in an Array
- Find maximum xor of k elements in an array
- Find elements which are present in first array and not in second
- Find single in an array of 2n+1 integer elements
- Find the original Array using XOR values of all adjacent elements
- Find array using different XORs of elements in groups of size 4
- Find even occurring elements in an array of limited range
- Find the first repeating element in an array of integers
- Find the smallest and second smallest elements in an array
- Maximize sum of topmost elements of S stacks by popping at most N elements
- Construct an array from XOR of all elements of array except element at same index
- Minimizing array sum by applying XOR operation on all elements of the array
- For each element in 1st array count elements less than or equal to it in 2nd array
- For each element in 1st array count elements less than or equal to it in 2nd array | Set 2
- Count of elements to be inserted to make Array sum twice the XOR of Array