fork download 
  1. #include <iostream>
  2. #include <map>
  3. using namespace std;
  4.  
  5. int main() {
  6.     int n = 6;
  7.     int arr[] = {1, 2, 2, 3, 3, 3};
  8.  
  9.     map<int, int> mp;
  10.     int maxiFreq = 0, maxiElement = 0;
  11.     int miniFreq = n + 1, miniElement = 0;
  12.  
  13.     for (int i = 0; i < n; i++) {
  14.         if (mp.find(arr[i]) == mp.end()) {
  15.             mp[arr[i]] = 1;
  16.         } else {
  17.             mp[arr[i]]++;
  18.         }
  19.  
  20.         if (maxiFreq < mp[arr[i]]) {
  21.             maxiFreq = mp[arr[i]];
  22.             maxiElement = arr[i];
  23.         }
  24.  
  25.         if (miniFreq > mp[arr[i]]) {
  26.             miniFreq = mp[arr[i]];
  27.             miniElement = arr[i];
  28.         }
  29.     }
  30.  
  31.     cout << "Max frequency element: " << maxiElement << " with frequency: " << maxiFreq << endl;
  32.     cout << "Min frequency element: " << miniElement << " with frequency: " << miniFreq << endl;
  33.  
  34.     return 0;
  35. }
  36.  
Success #stdin #stdout 0s 5308KB
comments (?)
stdin 
Standard input is empty
stdout 
Max frequency element: 3 with frequency: 3
Min frequency element: 1 with frequency: 1
https://ideone.com/8mQJMh
We are given an Array of Numbers. We have to find and print any Number with Maximum Frequency and Minimum Frequency.
language:
C++ (gcc 8.3)
created:
9 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!