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.
  1. Prepare
  2. Java
  3. Data Structures
  4. Java Dequeue
  5. Discussions

Java Dequeue

Sort by

recency

|

334 Discussions

|

  • shaunw3bb17
     + 0 comments

    my solution: import java.util.*; public class test { public static void main(String[] args) { Scanner in = new Scanner(System.in); Deque deque = new ArrayDeque<>(); Set set = new HashSet<>(); int n = in.nextInt(); int m = in.nextInt(); int max = 0;

            for (int i = 0; i < n; i++) {
            int num = in.nextInt();
            deque.addLast(num);
            set.add(num);

        if(deque.size() == m){
            max = Math.max(max, set.size());
            int first = deque.removeFirst();
            if(!deque.contains(first)){
                set.remove(first);
            }
        }
    }
   System.out.println(max); 
 }

}

  • yashdeora98294
     + 0 comments

    Here is Java Dequeue solution - https://programmingoneonone.com/hackerrank-java-dequeue-problem-solution.html

  • tony_hano
     + 0 comments

    import java.io.; import java.util.;

    public class Solution {

    public static void main(String[] args) {  
List<Integer> list1 = new ArrayList<>(Arrays.asList(6, 5));

    List list2 = new ArrayList<>(Arrays.asList(5, 3, 5, 2, 3, 2)); List> list3 = new ArrayList<>(); list3.add(list1); list3.add(list2); maxUniqeNumbers(list3); System.out.println (maxUniqeNumbers(list3)); } public static int maxUniqeNumbers (List> list3) { int max = 3; int x = 3; for (List innerList : list3) { if (innerList.size () < 3) { continue ; } else { int i = 0 ; // int n = 0 ;

    for (i = 0 ; i < innerList.size() - 2 ; i++) {
        int m = 0;
    if (innerList.get (i) == innerList.get (i+1)) {
       m++; 
    }
    if (innerList.get (i) == innerList.get (i+2)) {
       m++; 
    }
    if (innerList.get (i+2) == innerList.get (i+1)) {
       m++; 
    }

    if (m < x) { x = m ;
    } }

    }
 }
 return max - x ;

    } }

  • h2604952343
     + 1 comment
    import java.util.ArrayDeque;
import java.util.Deque;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class Solution {

    public static void main(String[] args) {
		Deque<String> deque = new ArrayDeque<>();
		Scanner sc = new Scanner(System.in);
		String input = sc.nextLine();
		String[] str = input.split(" ");
		int size = Integer.valueOf(str[0]);
		String s = sc.nextLine();
		sc.close();
		String[] s2 = s.split(" ");
		Set<String> set = new HashSet<>();
		int max = 0;
		for (int str1 = 0; str1 < Integer.valueOf(str[1]); str1++) {
			deque.offerLast(s2[str1]);
		}
		set.addAll(deque);
		max = set.size();
		
		for (int i = Integer.valueOf(str[1]) + 1; i < size; i++) {
			deque.pollFirst();
			deque.offerLast(s2[i]);
			set.clear();
			set.addAll(deque);
			max = Math.max(max, set.size());
		}
		
		System.out.println(max);
	}
}

  • anatoltbcm
     + 0 comments

    My solution.

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        Deque<Integer> deque = new ArrayDeque<>();
        Map<Integer, Integer> numCount = new HashMap<>();
        int max = 0;
        int n = in.nextInt();
        int m = in.nextInt();

        for (int i = 0; i < n; i++) {
            int num = in.nextInt();
            deque.offerLast(num);
            numCount.merge(num, 1, Integer::sum);

            if (deque.size() > m) {
                Integer val = deque.pollFirst();
                if (numCount.merge(val, -1, Integer::sum) == 0) {
                    numCount.remove(val);
                }
            }

            if (deque.size() == m && numCount.size() > max) {
                max = numCount.size();
            }
        }

        in.close();

        System.out.println(max);
    }