Related Articles

# Two odd occurring elements in an array where all other occur even times

• Difficulty Level : Easy
• Last Updated : 30 Apr, 2021

Given an array where all elements appear even number of times except two, print the two odd occurring elements. It may be assumed that the size of array is at-least two.

Examples:

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.

In case you wish to attend live classes with experts, please refer DSA Live Classes for Working Professionals and Competitive Programming Live for Students.

```Input : arr[] = {2, 3, 8, 4, 4, 3, 7, 8}
Output : 2 7

Input : arr[] = {15, 10, 10, 50 7, 5, 5, 50, 50, 50, 50, 50}
Output : 7 15```

A simple solution is to use two nested loops. The outer loop traverses through all elements. The inner loop counts occurrences of the current element. We print the elements whose counts of occurrences are odd. Time complexity if this solution is O(n2)

A better solution is to use hashing. Time complexity of this solution is O(n) but it requires extra space.

An efficient solution is to use bitwise operators. The idea is based on approach used in two missing elements and two repeating elements.

## C++

 `// CPP code to find two odd occurring elements``// in an array where all other elements appear``// even number of times.``#include ``using` `namespace` `std;` `void` `printOdds(``int` `arr[], ``int` `n)``{``    ``// Find XOR of all numbers``    ``int` `res = 0;``    ``for` `(``int` `i = 0; i < n; i++)``        ``res = res ^ arr[i];` `    ``// Find a set bit in the XOR (We find``    ``// rightmost set bit here)``    ``int` `set_bit = res & (~(res - 1));` `    ``// Traverse through all numbers and``    ``// divide them in two groups``    ``// (i) Having set bit set at same``    ``//     position as the only set bit``    ``//     in set_bit``    ``// (ii) Having 0 bit at same position``    ``//      as the only set bit in set_bit``    ``int` `x = 0, y = 0;``    ``for` `(``int` `i = 0; i < n; i++) {``        ``if` `(arr[i] & set_bit)``            ``x = x ^ arr[i];``        ``else``            ``y = y ^ arr[i];``    ``}` `    ``// XOR of two different sets are our``    ``// required numbers.``    ``cout << x << ``" "` `<< y;``}` `// Driver code``int` `main()``{``    ``int` `arr[] = { 2, 3, 3, 4, 4, 5 };``    ``int` `n = ``sizeof``(arr) / ``sizeof``(arr);``    ``printOdds(arr, n);``    ``return` `0;``}`

## Java

 `// Java code to find two``// odd occurring elements``// in an array where all``// other elements appear``// even number of times.` `class` `GFG``{``static` `void` `printOdds(``int` `arr[],``                      ``int` `n)``{``    ``// Find XOR of``    ``// all numbers``    ``int` `res = ``0``;``    ``for` `(``int` `i = ``0``; i < n; i++)``        ``res = res ^ arr[i];` `    ``// Find a set bit in the``    ``// XOR (We find rightmost``    ``// set bit here)``    ``int` `set_bit = res &``                  ``(~(res - ``1``));` `    ``// Traverse through all``    ``// numbers and divide them``    ``// in two groups (i) Having``    ``// set bit set at same position``    ``// as the only set bit in``    ``// set_bit (ii) Having 0 bit at``    ``// same position as the only``    ``// set bit in set_bit``    ``int` `x = ``0``, y = ``0``;``    ``for` `(``int` `i = ``0``; i < n; i++)``    ``{``        ``if` `((arr[i] & set_bit) != ``0``)``            ``x = x ^ arr[i];``        ``else``            ``y = y ^ arr[i];``    ``}` `    ``// XOR of two different``    ``// sets are our required``    ``// numbers.``    ``System.out.println( x + ``" "` `+ y);``}` `// Driver code``public` `static` `void` `main(String [] args)``{``    ``int` `arr[] = { ``2``, ``3``, ``3``,``                  ``4``, ``4``, ``5` `};``    ``int` `n = arr.length;``    ``printOdds(arr, n);``}``}` `// This code is contributed by``// Smitha Dinesh Semwal`

## Python3

 `# Python 3 code to find two``# odd occurring elements in``# an array where all other``# elements appear even number``# of times.``def` `printOdds(arr, n):` `    ``# Find XOR of all numbers``    ``res ``=` `0``    ``for` `i ``in` `range``(``0``, n):``        ``res ``=` `res ^ arr[i]` `    ``# Find a set bit in``    ``# the XOR (We find``    ``# rightmost set bit here)``    ``set_bit ``=` `res & (~(res ``-` `1``))` `    ``# Traverse through all numbers``    ``# and divide them in two groups``    ``# (i) Having set bit set at``    ``# same position as the only set``    ``# bit in set_bit``    ``# (ii) Having 0 bit at same``    ``# position as the only set``    ``# bit in set_bit``    ``x ``=` `0``    ``y ``=` `0``    ``for` `i ``in` `range``(``0``, n):``        ``if` `(arr[i] & set_bit):``            ``x ``=` `x ^ arr[i]``        ``else``:``            ``y ``=` `y ^ arr[i]``    ` `    ``# XOR of two different``    ``# sets are our``    ``# required numbers.``    ``print``(x , y, end ``=` `"")` `# Driver code``arr ``=` `[``2``, ``3``, ``3``, ``4``, ``4``, ``5` `]``n ``=` `len``(arr)``printOdds(arr, n)` `# This code is contributed``# by Smitha`

## C#

 `// C# code to find two``// odd occurring elements``// in an array where all``// other elements appear``// even number of times.``using` `System;` `class` `GFG``{``static` `void` `printOdds(``int` `[]arr,``                      ``int` `n)``{``    ``// Find XOR of``    ``// all numbers``    ``int` `res = 0;``    ``for` `(``int` `i = 0; i < n; i++)``        ``res = res ^ arr[i];` `    ``// Find a set bit in the``    ``// XOR (We find rightmost``    ``// set bit here)``    ``int` `set_bit = res &``               ``(~(res - 1));` `    ``// Traverse through all``    ``// numbers and divide them``    ``// in two groups (i) Having``    ``// set bit set at same position``    ``// as the only set bit in``    ``// set_bit (ii) Having 0 bit at``    ``// same position as the only``    ``// set bit in set_bit``    ``int` `x = 0, y = 0;``    ``for` `(``int` `i = 0; i < n; i++)``    ``{``        ``if` `((arr[i] & set_bit) != 0)``            ``x = x ^ arr[i];``        ``else``            ``y = y ^ arr[i];``    ``}` `    ``// XOR of two different``    ``// sets are our required``    ``// numbers.``    ``Console.WriteLine(x + ``" "` `+ y);``}` `// Driver code``public` `static` `void` `Main()``{``    ``int` `[]arr = { 2, 3, 3,``                  ``4, 4, 5 };``    ``int` `n = arr.Length;``    ``printOdds(arr, n);``}``}` `// This code is contributed by``// Akanksha Rai(Abby_akku)`

## PHP

 ``

## Javascript

 ``
Output:
`5 2`

Time Complexity : O(n)
Auxiliary Space : O(1)

My Personal Notes arrow_drop_up