class Solution {
public:
    int findShortestSubArray(vector<int>& nums) {
        unordered_map<int ,vector<int>> hash;
        for(int i=0;i<nums.size();i++)
        {
            if(hash.count(nums[i]))
            {
                hash[nums[i]][0]++;
                hash[nums[i]][2] = i;
            }
            else
            {
                hash[nums[i]] = {1,i,i};
            }
        }
        int maxNum = 0;
        int minLen = INT_MAX;
        for(auto& kv : hash)
        {
            if(maxNum < kv.second[0])
            {
                maxNum = kv.second[0];
                minLen = kv.second[2] - kv.second[1] + 1;
            }
            else if(maxNum == kv.second[0])
            {
                if(minLen > kv.second[2] - kv.second[1] + 1)
                    minLen = kv.second[2] - kv.second[1] + 1;
            }
        }

        return minLen;
    }
};