Majority Element.cpp

#include<bits/stdc++.h>
using namespace std;

class Solution{
  public:
     // Function to find majority element in the array
    // a: input array
    // size: size of input array
   int majorityElement(int a[], int size)
    {
        if(size==1){
            return a[0];
        }
        int number[1000000]={0};
        int n=size/2;
        for(int i=0;i<size;i++){
            number[a[i]]++;
        }
        for(int i=0;i<1000000;i++){
            if(number[i]>n){
                return i;
            }
        }
        
        return -1;
        
    }

};

int main(){

    int t;
    cin >> t;

    while(t--){
        int n;
        cin >> n;
        int arr[n];
        
        for(int i = 0;i<n;i++){
            cin >> arr[i];
        }
        Solution obj;
        cout << obj.majorityElement(arr, n) << endl;
    }

    return 0;
}