697. Degree of an Array

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

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

Example 1:

Input: [1, 2, 2, 3, 1]Output: 2Explanation: 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.

Example 2:

Input: [1,2,2,3,1,4,2]Output: 6

Note:

nums.length will be between 1 and 50,000.

nums[i] will be an integer between 0 and 49,999.

---

Seen this question in a real interview before?

class Solution {    public int findShortestSubArray(int[] nums) {        Map<Integer, Integer[]> data = new HashMap<>();int max = 1;for (int i = 0; i < nums.length; ++i) {if (data.containsKey(nums[i])) {Integer[] temp = data.get(nums[i]);temp[1] = i;temp[2]++;max = Math.max(max, temp[2]);} else {data.put(nums[i], new Integer[] {i, i, 1});}}int re = Integer.MAX_VALUE;for(int n : data.keySet()) {Integer[] temp = data.get(n);if (temp[2] == max)re = Math.min(re, temp[1] - temp[0] + 1);}return re;    }}