problem no 57:(problem on hashmap):find the majority element inside the array.

QUESTION:

Majority Element

Easy Accuracy: 48.6% Submissions: 36991 Points: 2

---

Given an array A of N elements. Find the majority element in the array. A majority element in an array A of size N is an element that appears more than N/2 times in the array.
 

Example 1:

Input:
N = 3 
A[] = {1,2,3} 
Output:
-1
Explanation:
Since, each element in 
{1,2,3} appears only once so there 
is no majority element.

Example 2:

Input:
N = 5 
A[] = {3,1,3,3,2} 
Output:
3
Explanation:
Since, 3 is present more
than N/2 times, so it is 
the majority element.

 

ANSWER: 

int majorityElement(int arr[], int size)
{
     unordered_map<int, int> m;
    for(int i = 0; i < size; i++)
        m[arr[i]]++;
    int count = 0;
    for(auto i : m)
    {
        if(i.second > size / 2)
        {
            count =1;
            return i.first;
            break;
        }
    }
    if(count == 0)
        return -1;
   
}