<p>Given a non-empty array of non-negative integers <code>nums</code>, the <b>degree</b> of this array is defined as the maximum frequency of any one of its elements.</p>

<p>Your task is to find the smallest possible length of a (contiguous) subarray of <code>nums</code>, that has the same degree as <code>nums</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,2,2,3,1]
<strong>Output:</strong> 2
<strong>Explanation:</strong> 
The input array has a degree of 2 because both elements 1 and 2 appear twice.
Of the subarrays that have the same degree:
[1, 2, 2, 3, 1], [1, 2, 2, 3], [2, 2, 3, 1], [1, 2, 2], [2, 2, 3], [2, 2]
The shortest length is 2. So return 2.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,2,2,3,1,4,2]
<strong>Output:</strong> 6
<strong>Explanation:</strong> 
The degree is 3 because the element 2 is repeated 3 times.
So [2,2,3,1,4,2] is the shortest subarray, therefore returning 6.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>nums.length</code> will be between 1 and 50,000.</li>
	<li><code>nums[i]</code> will be an integer between 0 and 49,999.</li>
</ul>

vector<int> HighestDegreeVector(unordered_map<int,int>& uoMap, int highestDegree)
{
    vector<int> highestDegreeNums;
    unordered_map<int,int>::iterator itr = uoMap.begin();    
    while(itr != uoMap.end())
    {
        if(itr->second == highestDegree)
        {
            highestDegreeNums.push_back(itr->first);
        }
        itr++;            
    }

    return highestDegreeNums;
}

int GetArrayMaxDegree(unordered_map<int,int>& uoMap)
{
    int maxDegreeNumFrequency = 0;
    unordered_map<int,int>::iterator itr = uoMap.begin();
    while(itr != uoMap.end())
    {
        if(itr->second > maxDegreeNumFrequency)
        {
            maxDegreeNumFrequency = itr->second;           
        }
        itr++;            
    }

    return maxDegreeNumFrequency;
}
class Solution {
public:
    int findShortestSubArray(vector<int>& nums) 
    {
        ios_base::sync_with_stdio(false);         
        cin.tie(nullptr);

        unordered_map<int,int> unMap;
        for(int val : nums)
        {
            unMap[val]++;
        }

        int maxDegreeNumFrequency = GetArrayMaxDegree(unMap);
        vector<int> highestDegreeNums = HighestDegreeVector(unMap, maxDegreeNumFrequency);

        int maxDegree = INT_MAX;

        for(int val : highestDegreeNums)
        {
            int degree = 0;
            int start = -1, end = -1;
            for(int i=0; i<nums.size(); ++i )
            {
                if(nums[i] == val)
                {                
                    degree++;
                    if(start == -1)
                    {
                     start = i;
                    }
                     if(degree == maxDegreeNumFrequency)
                    {
                        end = i;
                        break;
                    }
                }           
            }

            maxDegree = min(maxDegree, ((end - start) + 1));
        }       

        return maxDegree;
    }
};
28867