HighestFrequencynum.cpp

//This code finds out the highest frequency number in an array using STL implementation of hashmaps
#include<iostream>
#include<climits>
#include<unordered_map>
using namespace std;
	int highestFrequency(int *input, int n){	 
		
      int key;
      unordered_map<int,int>m;
      for(int i=0;i<n;i++)
      {    key=input[i];
       // to check if that key is present before
         if(m.count(key)==0)
           m[key]=1;
         else
             m[key]++;
      }
     	int max=INT_MIN;
      int d;
      
      for(int i=0;i<n;i++)
      {
        if(max<m[input[i]])
        { max=m[input[i]];
        d=input[i];
      }
      }
     	return d;
 	}


int main()
{
    int n;
    int input[100000];
    cin>>n;
    for(int i=0; i<n; i++)
    {
        cin>>input[i];
    }
    int maxKey= highestFrequency(input, n);
    cout<<maxKey;
    return 0;
}