Longest k-distinct subarray
Given an integer array a and an integer k, return the length of the longest contiguous subarray that contains at most k distinct values. If k <= 0 or the array is empty, return 0.
Implement
longest_at_most_k_distinct(a: list[int], k: int) → intExamples
in
[[1,2,1,2,3],2]out4What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 25 min
solution.py
InputExpectedGot
[[1,2,1,2,3],2]4not run yetsample