leetCode1207

class Solution {
public:
    bool uniqueOccurrences(vector<int>& arr) {
        map<int,int>mp;
        for(int i = 0;i<arr.size();i++)
        {
            if(!mp.count(arr[i]))
            {
                mp[arr[i]] = 1;
            }
            else
            {
                mp[arr[i]]++;
            }
        }
        set<int>num;
        set<int>c;
        for(int i = 0;i<arr.size();i++)
        {
            if(!num.count(arr[i]))
            {
                num.insert(arr[i]);
                if(!c.count(mp[arr[i]]))
                {
                    c.insert(mp[arr[i]]);
                }
                else
                {
                    return false;
                }
            }
        }
        return true;
    }
};