Leetcode 1852. Distinct Numbers in Each Subarray

Given an array and window size k, return the number of distinct elements in every contiguous subarray of length k. The key challenge is to update unique counts efficiently across overlapping windows (sliding-window with frequency counts) to avoid O(nk) work.