Practice Uber Coding Question | Real Coding Interviews | Hack2hire

NewDark mode is now available across the siteSee what's new

Question Bank 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 Window

Two Pointers

Hashing

Test Cases

Input

Output

Expected