Windows with k distinct values
Given an integer array nums, a window size k (1 <= k <= length), and an integer m, count how many windows of k consecutive elements contain at least m distinct values. Maintain a value-count map and a running distinct counter as the window slides; do not rebuild a set per window. Example: nums = [1, 1, 1, 2, 1], k = 3, m = 2 gives 2 — windows [1,1,2] and [1,2,1] qualify, [1,1,1] does not.
Implement
count_varied_windows(nums: list[int], k: int, m: int) → intExamples
in
[[1,1,1,2,1],3,2]out2What 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 14 min
solution.py
InputExpectedGot
[[1,1,1,2,1],3,2]2not run yetsample