Given an array of positive integers. All numbers occur even number of times except one number which occurs odd number of times. Find the number in O(n) time & constant space.

**Example:**

I/P = [1, 2, 3, 2, 3, 1, 3]

O/P = 3

A **Simple Solution** is to run two nested loops. The outer loop picks all elements one by one and inner loop counts number of occurrences of the element picked by outer loop. Time complexity of this solution is O(n^{2}).

A **Better Solutio**n is to use Hashing. Use array elements as key and their counts as value. Create an empty hash table. One by one traverse the given array elements and store counts. Time complexity of this solution is O(n). But it requires extra space for hashing.

The **Best Solution** is to do bitwise XOR of all the elements. XOR of all elements gives us odd occurring element. Please note that XOR of two elements is 0 if both elements are same and XOR of a number x with 0 is x.

Below are implementations of this best approach.

**Program:**

- C/C++

`//C program to find the element occurring odd number of times`

`#include <stdio.h>`

`int`

`getOddOccurrence(`

`int`

`ar[], `

`int`

`ar_size)`

`{`

` `

`int`

`i;`

` `

`int`

`res = 0; `

` `

`for`

`(i=0; i < ar_size; i++) `

` `

`res = res ^ ar[i];`

` `

` `

`return`

`res;`

`}`

`/* Diver function to test above function */`

`int`

`main()`

`{`

` `

`int`

`ar[] = {2, 3, 5, 4, 5, 2, 4, 3, 5, 2, 4, 4, 2};`

` `

`int`

`n = `

`sizeof`

`(ar)/`

`sizeof`

`(ar[0]);`

` `

`printf`

`(`

`"%d"`

`, getOddOccurrence(ar, n));`

` `

`return`

`0;`

`}`

Output:

5

**
Time Complexity:**O(n)