Count distinct elements in every window
Submissions: 31656   Accuracy:


  Difficulty: Easy   Marks: 2

Given an array A[] of size N and an integer K. Your task is to complete the function countDistinct() which prints the count of distinct numbers in all windows of size k in the array A[].

The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case contains two integers N and K. Then in the next line are N space separated values of the array A[].

For each test case in a new line print the space separated values denoting counts of distinct numbers in all windows of size k in the array A[].

1 <= T <= 100
1 <= N, K <= 100
1 <= A[] <= 100

Example(To be used only for expected output):
7 4
1 2 1 3 4 2 3
3 2
4 1 1

3 4 4 3
2 1

Note:The Input/Ouput format and Example given are used for system's internal purpose, and should be used by a user for Expected Output only. As it is a function problem, hence a user should not read any input from stdin/console. The task is to complete the function specified, and not to write the full code.

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Amit Khandelwal
Author: Shubham Joshi 1

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

Need help with your code? Please use, generate link and share the link here.

to report an issue on this page.