Menu
×
   ❮     
HTML CSS JAVASCRIPT SQL PYTHON JAVA PHP C C++ C# AWS W3.CSS HOW TO BOOTSTRAP REACT MYSQL JQUERY EXCEL XML DJANGO NUMPY PANDAS NODEJS DSA TYPESCRIPT ANGULAR ANGULARJS GIT POSTGRESQL MONGODB ASP AI R GO KOTLIN SWIFT SASS VUE GEN AI SCIPY CYBERSECURITY DATA SCIENCE INTRO TO PROGRAMMING INTRO TO HTML & CSS BASH RUST TOOLS MATH

Java Tutorial

Java HOME Java Intro Java Get Started Java Syntax Java Output Java Comments Java Variables Java Data Types Java Type Casting Java Operators Java Strings Java Math Java Booleans Java If...Else Java Switch Java While Loop Java For Loop Java Break/Continue Java Arrays

Java Methods

Java Methods Java Method Challenge Java Method Parameters Java Method Overloading Java Scope Java Recursion

Java Classes

Java OOP Java Classes/Objects Java Class Attributes Java Class Methods Java Class Challenge Java Constructors Java this Keyword Java Modifiers Java Encapsulation Java Packages / API Java Inheritance Java Polymorphism Java super Keyword Java Inner Classes Java Abstraction Java Interface Java Anonymous Java OOP Visuals Java Enum Java User Input Java Date

Java Errors

Java Errors Java Debugging Java Exceptions Java Multiple Exceptions Java try-with-resources

Java Problem Solving

Java Problem Solving Java Build the Logic Java Test Cases

Java Projects

Java Projects

Java File Handling

Java Files Java Create Files Java Write Files Java Read Files Java Delete Files

Java I/O Streams

Java I/O Streams Java FileInputStream Java FileOutputStream Java BufferedReader Java BufferedWriter

Java Data Structures

Java Data Structures Java Collections Java List Java ArrayList Java LinkedList Java List Sorting Java Set Java HashSet Java TreeSet Java LinkedHashSet Java Map Java HashMap Java TreeMap Java LinkedHashMap Java Iterator Java Algorithms

Java Advanced

Java Wrapper Classes Java Generics Java Annotations Java RegEx Java Threads Java Lambda Java Optional Java Advanced Sorting

Java Cert

Java Certificate

Java How To's

Java How Tos

Java Examples

Java Examples Java Videos Java Compiler Java Exercises Java Quiz Java Code Challenges Java Practice Problems Java Server Java Syllabus Java Study Plan Java Interview Q&A

Java Reference

Java Reference Java Keywords ArrayList Methods Arrays Methods BufferedReader BufferedWriter Character Methods Collections Methods Comparator Methods Date and Time Enum Methods Errors & Exceptions File Methods FileInputStream FileOutputStream FileReader FileWriter HashMap Methods HashSet Methods Integer Methods Iterator Methods LinkedHashMap Methods LinkedHashSet Methods LinkedList Methods Math Methods Optional Methods Output Methods Random Methods RegEx Methods Scanner Methods String Methods StringBuilder Methods System Methods Thread Methods TreeMap Methods TreeSet Methods


Java ArrayDeque


Java ArrayDeque

An ArrayDeque is a special type of queue that lets you add or remove elements from both the front and the back.

The word "Deque" stands for Double-Ended Queue. This means you can treat it like a line where people can join or leave from either end.

It is part of the java.util package and implements both the Queue and Deque interfaces.

Tip: ArrayDeque is faster than LinkedList and has no size limit.


Create an ArrayDeque

Example

Create an ArrayDeque object called cars that will store Strings:

import java.util.ArrayDeque;

ArrayDeque<String> cars = new ArrayDeque<>();

Now you can use methods like add() and addFirst() to add to the front, addLast() to add to the back, and poll() to remove items.


Add Items

You can add elements at the front or back of the deque:

Example

import java.util.ArrayDeque;

public class Main {
  public static void main(String[] args) {
    ArrayDeque<String> cars = new ArrayDeque<>();
    cars.add("Volvo");           // Add to back by default
    cars.addFirst("Mazda");      // Add to front
    cars.addLast("BMW");         // Add to back

    System.out.println(cars);
  }
}

Try it Yourself »



Remove Items

You can remove elements from the front or back of the deque:

Example

cars.poll();       // Removes first element (same as pollFirst())
cars.pollFirst();  // Removes from the front
cars.pollLast();   // Removes from the back

Try it Yourself »


Peek at Elements

Use peek() to look at elements without removing them:

Example

cars.peek();       // Looks at the first element
cars.peekFirst();  // Same as peek()
cars.peekLast();   // Looks at the last element

Try it Yourself »


Loop Through an ArrayDeque

Use a for-each loop to go through all elements:

Example

for (String car : cars) {
  System.out.println(car);
}

Try it Yourself »


When to Use ArrayDeque?

Use ArrayDeque when you need a fast and flexible way to add or remove elements from both ends of a queue.

  • When you want a better alternative to LinkedList for queues and stacks
  • When you don't need to access elements by index (like in a List)

Free account

Track your progress

XP earned 0 Day streak 0 Spaces 0 League —

New

Learn in Adventure Mode W3Schools Adventure App

Coding fundamentals as bite-sized lessons and challenges.

×

Contact Sales

If you want to use W3Schools services as an educational institution, team or enterprise, send us an e-mail:
sales@w3schools.com

Report Error

If you want to report an error, or if you want to make a suggestion, send us an e-mail:
help@w3schools.com

W3Schools is optimized for learning and training. Examples might be simplified to improve reading and learning. Tutorials, references, and examples are constantly reviewed to avoid errors, but we cannot warrant full correctness of all content. While using W3Schools, you agree to have read and accepted our terms of use, cookies and privacy policy.

Copyright 1999-2026 by Refsnes Data. All Rights Reserved. W3Schools is Powered by W3.CSS.