Finding the Number Occurring Odd Number of Times in an Array

/* The code is contributed by Tangudu Sai Kiran. */
//A C++ program to find the odd times occurring element from a given input array using Hashing
#include <bits/stdc++.h>
using namespace std;

//Function to find element which occurred odd number of times	
void findOccurance(int n, int arr[])
{
    //Defining a HashMap
    unordered_map<int, int> elements;  
        
    //Inserting elements into the Hashmap
    for(int i = 0; i < n; i++)
           elements[arr[i]]++;
	 
     //Iterate through the hashmap to find odd occurring element if exists
     for(auto it : elements)
     {
	    //checking for majority condition
          if(it.second % 2 != 0){
              cout<<"ODD OCCURRING ELEMENT: "<< it.first<< endl;
              return;
          }
      }
      cout<<"THERE IS NO ODD OCCURRING ELEMENT"<<endl;
	return;
}
int main()
{
    int arr[] = {6, 5, 2, 5, 4, 2, 6};
    int n = sizeof(arr) / sizeof(arr[0]);
    //Function call
    findOccurance(n, arr);
    return 0;
}

/* The code is contributed by Tammisetti Naveen */
//A JAVA program to find odd times occurring number using Hashing
import java.util.HashMap;
public class OddOccurrenceElement 
{
	//function to find the element which occurs odd no of times
	static void FindOccurence (int n, int arr[])	{
		HashMap<Integer,Integer> Hsmap = new HashMap<Integer, Integer>();
		for (int i = 0; i < n; i++)
		{
			//if the key is repeated, its value is incremented else element is added and its frequency is 1
			if (Hsmap.containsKey(arr[i]))
			{
				Hsmap.put (arr[i], Hsmap.get(arr[i]) + 1);
			}
			else
			{
				Hsmap.put(arr[i], 1);
			}
		}
		for (int i = 0;i < n; i++)
		{
			if(Hsmap.get(arr[i]) % 2 != 0)
			{
				System.out.print (arr[i]);
				return;
			}
		}
		System.out.println ("THERE IS NO NUMBER OCCURRING ODD NUMBER OF TIMES");
	}
	
	public static void main(String args[])
	{
		int arr[] = {6, 5, 2, 5, 4, 2, 6};
		int n = arr.length;
		//Function call
		FindOccurence(n, arr);
	}
}

//Hashing method to find which occurrence odd number of times
def findOddOccurence(array):
    d=dict()#to store key:value pairs
    for i in array:
        if i in d:
            d[i]+=1   #if element is present then increment its value by 1
        else:
            d[i]=1    #if element not present then initialize its value to 1
    for j in d.keys():
        if d[j]%2!=0:
            print('THE NUMBER OCCURRING ODD TIMES:', j)
            return
    print('THERE IS NO NUMBER OCCURRING ODD NUMBER OF TIMES')

if __name__=="__main__":
    array=[6, 5, 2, 5, 4, 2, 6]
    findOddOccurence(array)

//A C++ program to find odd Occurrence of element in an given array using XOR method
//XOR METHOD
/* The code is contributed by Tangudu Sai Kiran. */
//A C++ program to find the odd times occurring element from a given input array using Hashing
#include <bits/stdc++.h>
using namespace std;

//Function to find element which occurred odd number of times
void findOccurance(int n, int arr[])
{
    //Defining a HashMap
    unordered_map<int, int> elements;

    //Inserting elements into the Hashmap
    for(int i = 0; i < n; i++)
        elements[arr[i]]++;

    //Iterate through the hashmap to find odd occurring element if exists
    for(auto it : elements)
    {
        //checking for majority condition
        if(it.second % 2 != 0)
        {
            cout<<"ODD OCCURRING ELEMENT: "<< it.first<< endl;
            return;
        }
    }
    cout<<"THERE IS NO ODD OCCURRING ELEMENT"<<endl;
    return;
}
int main()
{
    int arr[] = {6, 5, 2, 5, 4, 2, 6};
    int n = sizeof(arr) / sizeof(arr[0]);
    //Function call
    findOccurance(n, arr);
    return 0;
}

//A JAVA program to find odd Occurrence of element in an given array using XOR method
//XOR METHOD

public class findOccurrenceNumber
{
	
	static void findOccurrence(int n, int arr[])
	{
		int result = 0;
		for (int i = 0; i < n; i++)
			result = result ^ arr[i];
		if(result == 0)
		    System.out.println("No odd times occurring element");
		else
    		System.out.print("Odd times occurring element:"+result);
	}
	
	public static void main(String[] args) 
	{
		int arr[] = {6, 5, 2, 5, 4, 2, 6};
		int n = arr.length;
		findOccurrence(n, arr);//Function call
	}

}

//XOR method to find odd Occurrence of element in array
def findOddOccurence(array):
    r=0
    for i in array:
        r=r^i
    print(r)
if __name__=="__main__":
    array=[6, 5, 2, 5, 4, 2, 6]
    findOddOccurence(array)