(124). 32.3. HASHING ‐ COUNT FREQUENCY OF ELEMENT. - anishsingh90/Data_Structure_And_Algorithm_In_Cpp_github.io GitHub Wiki

//ORDERED MAP

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

int main() { int n; cout << "Enter the size of array: "; cin >> n;

vector<int> arr(n);
for (int i = 0; i < n; i++) {
    cin >> arr[i];
}

map<int, int> freq;
for (int i = 0; i < n; i++) {
    freq[arr[i]]++;
}

map<int, int>::iterator it;
for (it = freq.begin(); it != freq.end(); it++) {
    cout << it->first << " " << it->second << endl;
}

return 0;

}

/* OUTPUT: Enter the size of array: 6 1 2 1 3 2 5 1 2 2 2 3 1 5 1 */

//UNORDERED_MAP

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

int main() { int n; cout << "Enter the size of array: "; cin >> n;

vector<int> arr(n);
for (int i = 0; i < n; i++) {
    cin >> arr[i];
}

unordered_map<int, int> freq;
for (int i = 0; i < n; i++) {
    freq[arr[i]]++;
}

unordered_map<int, int>::iterator it;
for (it = freq.begin(); it != freq.end(); it++) {
    cout << it->first << " " << it->second << endl;
}

return 0;

}

/* OUTPUT: Enter the size of array: 6 1 2 1 3 2 5 1 2 2 2 3 1 5 1 */

⚠️ **GitHub.com Fallback** ⚠️