We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
import java.util.*;
public class test {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
Deque<Integer> deque = new ArrayDeque<>();
int n = in.nextInt();
int m = in.nextInt();
// System.out.println(n);
// System.out.println(m);
int max = 0;
Set<Integer> set = new HashSet<>();
for (int i = 0; i < n; i++) {
int num = in.nextInt();
deque.add(num);
set.add(num);
if(deque.size()==m){
if(set.size()>max){
max=set.size();
}
int item = deque.remove();
if(!deque.contains(item))
set.remove(item);
}
}
System.out.println(max);
}
}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Java Dequeue
You are viewing a single comment's thread. Return to all comments →
}