Practice Uber Coding Question | Real Coding Interviews | Hack2hire

Product Pricing Blog Forum

Quick Summary

Find the shortest contiguous subarray containing at least k distinct integers.
Return -1 if the array does not contain enough unique values to satisfy k.
Requires an efficient approach to handle input sizes up to 10^5.

What This Tests

Sliding window technique for contiguous subarrays
Frequency tracking using hash maps or arrays
Two-pointer boundary expansion and contraction
Edge case validation and early termination logic

Common Patterns

Sliding WindowTwo PointersHashing

Hint 1

Hint 2

What Interviewers May Ask Next

Report seen similar question in interview

python

Test Cases

Input

Output

Expected