Shortest Subarray with K Distinct Integers — Google

← Google
Shortest Subarray with K Distinct Integers[ OK ] 34 — full content available
[ INFO ] category: Coding  difficulty: medium  freq: high  first seen: 2026-01-11
[MEDIUM][CODING][HIGH]ArraySliding WindowHash Table
$ cat problem.md
Given an array nums and an integer k, find the length of the shortest contiguous subarray that contains at least k distinct integers. If no such subarray exists, return -1.
Use sliding window with frequency hash table for O(n) solution.
user@intervues:~/google$ 
← Back to companies
[ OK ] Loaded  — 
[ INFO ] 
$ cd 
$ ls -lt 
01
02
03
04
05
$ ls -lt 
01
02
03
04
05
user@intervues:~/$ 