Count Unique Elements in Sliding Window

Given an integer array nums and an integer k, return an array containing the count of unique elements in each sliding window of size k. Input: - The first line contains the integer n (1 ≤ n ≤ 10^5): the number of elements in the array. - The second line contains n space-separated integers representing the elements of the array nums. - The third line contains an integer k (1 ≤ k ≤ n): the size of the sliding window. Output: - A space-separated list of integers containing the counts of unique elements for each window. Example: Input: 6 1 2 2 1 3 4 3 Output: 2 3 3