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<Integer>();
int n = in.nextInt();
int m = in.nextInt();
int max = 0;
Set<Integer> j = new HashSet<>();
for (int i = 0; i < n; i++) {
int num = in.nextInt();
deque.addLast(num);
j.add(num);
if(deque.size()==m){
int count = j.size();
if(max<count) max=count ;
int target = deque.removeFirst();
if(!deque.contains(target)) j.remove(target);
}
}
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 →