// We are given an Array of Numbers. //We have to find and print any Number with Maximum Frequency and Minimum Frequency. //Arr = [3, 2, 3, 2, 4, 3]
#include <iostream> 
#include <unordered_map>
#include <vector>
using namespace std; 
int main() 
{ vector<int> arr={3, 2, 3, 2, 4, 3,2,2,2,2,2}; 
unordered_map<int,int> hashmap; 
for (int i=0;i<arr.size();i++) 
 
{ 
	hashmap[arr[i]]=hashmap[arr[i]]+1; } 
	int maxFreq = -1, minFreq = arr.size()+1;
    int maxNum = -1, minNum = -1;
	for (auto &p : hashmap) 
	{
        if (p.second > maxFreq) {
            maxFreq = p.second;
            maxNum = p.first;
        }
        if (p.second < minFreq) {
            minFreq = p.second;
            minNum = p.first;
        }
    }
    cout<<maxNum<<"\n"<< minNum;
}

Ly8gV2UgYXJlIGdpdmVuIGFuIEFycmF5IG9mIE51bWJlcnMuIC8vV2UgaGF2ZSB0byBmaW5kIGFuZCBwcmludCBhbnkgTnVtYmVyIHdpdGggTWF4aW11bSBGcmVxdWVuY3kgYW5kIE1pbmltdW0gRnJlcXVlbmN5LiAvL0FyciA9IFszLCAyLCAzLCAyLCA0LCAzXQojaW5jbHVkZSA8aW9zdHJlYW0+IAojaW5jbHVkZSA8dW5vcmRlcmVkX21hcD4KI2luY2x1ZGUgPHZlY3Rvcj4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsgCmludCBtYWluKCkgCnsgdmVjdG9yPGludD4gYXJyPXszLCAyLCAzLCAyLCA0LCAzLDIsMiwyLDIsMn07IAp1bm9yZGVyZWRfbWFwPGludCxpbnQ+IGhhc2htYXA7IApmb3IgKGludCBpPTA7aTxhcnIuc2l6ZSgpO2krKykgCgp7IAoJaGFzaG1hcFthcnJbaV1dPWhhc2htYXBbYXJyW2ldXSsxOyB9IAoJaW50IG1heEZyZXEgPSAtMSwgbWluRnJlcSA9IGFyci5zaXplKCkrMTsKICAgIGludCBtYXhOdW0gPSAtMSwgbWluTnVtID0gLTE7Cglmb3IgKGF1dG8gJnAgOiBoYXNobWFwKSAKCXsKICAgICAgICBpZiAocC5zZWNvbmQgPiBtYXhGcmVxKSB7CiAgICAgICAgICAgIG1heEZyZXEgPSBwLnNlY29uZDsKICAgICAgICAgICAgbWF4TnVtID0gcC5maXJzdDsKICAgICAgICB9CiAgICAgICAgaWYgKHAuc2Vjb25kIDwgbWluRnJlcSkgewogICAgICAgICAgICBtaW5GcmVxID0gcC5zZWNvbmQ7CiAgICAgICAgICAgIG1pbk51bSA9IHAuZmlyc3Q7CiAgICAgICAgfQogICAgfQogICAgY291dDw8bWF4TnVtPDwiXG4iPDwgbWluTnVtOwp9