Leetcode 992. Subarrays with K Different Integers

Count the number of contiguous subarrays that contain exactly k distinct integers. A common approach is to use two-pointer/sliding-window with a frequency map to compute “at most K” minus “at most K−1” subarray counts in linear time.