class Solution {

public int findShortestSubArray(int[] nums) {

Map<Integer, Integer> left = new HashMap(),

right = new HashMap(), count = new HashMap();

for (int i = 0; i < nums.length; i++) {

int x = nums[i];

// left most position

if (left.get(x) == null) left.put(x, i);

// right most position

right.put(x, i);

count.put(x, count.getOrDefault(x, 0) + 1);

}

int ans = nums.length;

int degree = Collections.max(count.values());

for (int x: count.keySet()) {

if (count.get(x) == degree) {

ans = Math.min(ans, right.get(x) - left.get(x) + 1);

}

}

return ans;

}

}