Longest Subarray with K Distinct Values
Amazon● MediumNEW GRADONSITE INTERVIEWProblem statement
Given an integer array nums and an integer k, return the longest contiguous subarray containing exactly k distinct values.
The problem statement continues
ProExamples
Example 1
nums = [1,2,1,2,3]k = 2return = [1,2,1,2]The prefix [1,2,1,2] has exactly two distinct values and is the longest valid subarray.
FastPrep Pro
Reported in 1 Amazon interview this weekUnlock this recently reported problem
FastPrep Pro gives you full access to interview problems reported within the last week.
- Full problem statement and constraints
- 2 more worked examples, explained
- Guided hints and editorial
- Run your code on real test cases
$8.25/month
$99 billed yearly — or $19 month-to-month. Cancel anytime.
Free plan — 2 of 2 free unlocks used this week