How should I practice Shortest Subarray With at Least K Distinct Values?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Google onsite interview problems in FastPrep.

Is Shortest Subarray With at Least K Distinct Values associated with Google?

FastPrep tags this as a Google onsite interview coding practice problem when the problem catalog has that company and stage context.

Shortest Subarray With at Least K Distinct Values

Google● MediumNEW GRADINTERNONSITE INTERVIEW

Learn

Problem statement

Given an integer array nums and a positive integer k, return the minimum length of a contiguous subarray containing at least k distinct values.

Return -1 when no such subarray exists.

Function

shortestSubarrayAtLeastKDistinct(nums: int[], k: int) → int

Examples

Example 1

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

Subarray [2,1,3] has three distinct values and no length-two subarray can.

Example 2

nums = [1,1,1]k = 2return = -1

The entire array contains only one distinct value.

Example 3

nums = [5,6]k = 1return = 1

Any single element already contains one distinct value.

Constraints

1 <= nums.length <= 200000.
1 <= k <= nums.length.
-1000000000 <= nums[i] <= 1000000000.