Given an array that contains odd number of occurrences for all numbers except for a few elements which are present even number of times. Find the elements which have even occurrences in the array in O(n) time complexity and O(1) extra space.
Assume array contain elements in the range 0 to 63.
Input: [9, 12, 23, 10, 12, 12, 15, 23, 14, 12, 15] Output: 12, 23 and 15 Input: [1, 4, 7, 5, 9, 7, 3, 4, 6, 8, 3, 0, 3] Output: 4 and 7 Input: [4, 4, 10, 10, 4, 4, 4, 4, 10, 10] Output: 4 and 10
A simple method would be to traverse the array and store frequencies of its elements in a map. Later, print elements that have even count in the map. The solution takes O(n) time but requires extra space for storing frequencies. Below is an interesting method to solve this problem using bitwise operators.
This method assumes that long long integers are stored using 64 bits. The idea is to use XOR operator. We know that
1 XOR 1 = 0 1 XOR 0 = 1 0 XOR 1 = 1 0 XOR 0 = 0
Consider below input –
1, 4, 7, 5, 9, 7, 3, 4, 6, 8, 3, 0, 3
If we left-shift 1 by value of each element of the array and take XOR of all the items, we will get below binary integer –
Each 1 in the i’th index from the right represents odd occurrence of element i. And each 0 in the i’th index from the right represents even or non-occurrence of element i in the array.
0 is present in 2nd, 4th and 7th position in above binary number. But 2 is not present in our array. So our answer is 4 and 7.
Below is the implementation of above idea
12 23 15
This article is contributed by Aditya Goel. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above
GeeksforGeeks has prepared a complete interview preparation course with premium videos, theory, practice problems, TA support and many more features. Please refer Placement 100 for details
- Find duplicates in a given array when elements are not limited to a range
- Find the missing number in a sorted array of limited range
- Find frequency of each element in a limited range array in less than O(n) time
- Find the sum of all highest occurring elements in an Array
- Find array elements with frequencies in range [l , r]
- Sum of all minimum occurring elements in an Array
- Two odd occurring elements in an array where all other occur even times
- Find if array can be sorted by swaps limited to multiples of k
- GCD of elements occurring Fibonacci number of times in an Array
- Array range queries to find the number of perfect square elements with updates
- Find Kth most occurring element in an Array
- Smallest element repeated exactly ‘k’ times (not limited to small range)
- Elements to be added so that all elements of a range are present in array
- Find the XOR of the elements in the given range [L, R] with the value K for a given set of queries
- Find missing elements of a range