fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. typedef long long int ll;
  4. #include<vector>
  5.  
  6. int main() {
  7. 	// your code goes here
  8. 	vector<int>arr={3,2,3,2,4,3};
  9. 	unordered_map<int,int>mp;
  10. 	for(int i=0;i<arr.size();i++)
  11. 	 {
  12. 	 	mp[arr[i]]++;
  13. 	 }
  14.  
  15. 	  int min_freq=arr.size(),max_freq=0,min_element=0,max_element=0;
  16. 	 for(int i=0;i<arr.size();i++)
  17. 	  {
  18. 	  	if(mp[arr[i]]<min_freq)
  19. 	  	 {
  20. 	  	 	min_freq=mp[arr[i]];
  21. 	  	 	min_element=arr[i];
  22. 	  	 }
  23. 	  	 else if(mp[arr[i]]>max_freq)
  24. 	  	  {
  25. 	  	  	max_freq=mp[arr[i]];
  26. 	  	 	max_element=arr[i];
  27. 	  	  }
  28.  
  29. 	  }
  30.  
  31. 	  cout<<"minimum-freq"<<" element is - "<<min_element<<" frequency "<<min_freq;
  32. 	  cout<<endl;
  33. 	  cout<<"maximum-freq"<<" element is - "<<max_element<<" frequency "<<max_freq;
  34.  
  35.  
  36. 	return 0;
  37. }
Success #stdin #stdout 0.01s 5296KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
minimum-freq element is - 4 frequency 1
maximum-freq element is - 3 frequency 3
https://ideone.com/0ko1pc
language:
C++ (gcc 8.3)
created:
3 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!