Count Unique Elements in K Length

You are given an array of integers and an integer k. Your task is to count the number of unique integers in every contiguous subarray of length k. The first line of input consists of n (the size of array), followed by the integers of the array, and lastly the integer k. Output a list of integers representing the count of unique integers for each step over the array. Example: Input: 6 1 2 1 3 4 3 3 Output: 3 3 2