How should I practice Shortest Subarray With the Full Degree?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Agoda phone screen problems in FastPrep.

Is Shortest Subarray With the Full Degree associated with Agoda?

FastPrep tags this as a Agoda phone screen coding practice problem when the problem catalog has that company and stage context.

Agoda● MediumFULLTIMEPHONE SCREEN

The degree of an array is the largest frequency of any value. Return the length of the shortest contiguous subarray having the same degree as nums.

findShortestSubarray(nums: int[]) → int

nums = [1,2,2,3,1]return = 2

Case 1 exercises the documented deterministic contract.

nums = [1,2,2,3,1,4,2]return = 6

Case 2 exercises the documented deterministic contract.

nums = [1]return = 1

Case 3 exercises the documented deterministic contract.