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.
- Prepare
- Java
- Data Structures
- Java Dequeue
- Discussions
Java Dequeue
Java Dequeue
Sort by
recency
|
312 Discussions
|
Please Login in order to post a comment
import java.util.*;
public class test {
}
I have a solution optimized
import java.util.*; public class test { public static void main(String[] args) { Scanner in = new Scanner(System.in); Deque deque = new ArrayDeque<>(); int n = in.nextInt(); int m = in.nextInt(); int max = 0; Set set = new LinkedHashSet<>(); for (int i = 0; i < n; i++) { int num = in.nextInt(); deque.addLast(num); set.add(num); if (deque.size()==m){ //updtae max if(set.size()>max){ max = set.size(); } int first = deque.getFirst(); deque.removeFirst(); if(!deque.contains(first)){ set.remove(first); }
import java.util.*; public class test {
Time out limit is driving me crazy in the bad way. First time run code breaks at #9 #10 test case, but second time ahead only in #10