Occurence of Each Number

• Time : $O(nlogn)$
• Space : $O(n)$

c++

vector<int> Solution::findOccurences(vector<int> &A) {
    map<int, int> mp;
    for(auto a : A) mp[a]++;
    vector<int> res;
    for(auto& [_,v] : mp) res.push_back(v);
    return res;
}