DSA Level 2 Data Structures Hashmap and Heaps Count Distinct Elements In Every Window Of Size K

Count Distinct Elements In Every Window Of Size K

easy

Hashmap and Heaps

Question Solve Solutions

1. You are given an array(arr) of integers and a number K.
2. You have to find the count of distinct numbers in all windows of size k.

Input Format

A number N arr1 arr2.. N numbers A number K

Output Format

Space separated numbers representing the count of distinct numbers in all windows of size k.

Constraints

1 &lt;= N &lt;= 10^5
1 &lt;= arr[i] &lt;= 10^4
1 &lt;= k &lt;= N

Example

Input

7
1 2 1 3 4 2 3        
4

Output

3 4 4 3

Largest Subarray With Zero Sum

Largest Subarray With Contiguous Elements

Related Questions

easy Double Pair Array easy Subdomain Visit Count easy Group Anagrams easy Isomorphic Strings easy Valid Anagram easy Longest Subarray With Sum Divisible By K easy The Skyline Problem easy Word Pattern easy Number Of Employees Under Every Manager easy Find Itinerary From Tickets easy Check If An Array Can Be Divided Into Pairs Whose Sum Is Divisible By K easy Largest Subarray With Zero Sum easy Largest Subarray With Contiguous Elements medium Count Of All Subarrays With Zero Sum hard Smallest Substring Of A String Containing All Characters Of Another String medium Smallest Substring Of A String Containing All Unique Characters Of Itself