Deque - Introduction and Applications Last Updated : 01 Jul, 2025 Summarize Suggest changes Share Like Article Like Report Deque or Double Ended Queue is a generalized version of Queue data structure that allows insert and delete at both ends. Below is an example program of deque in different languages. Deque can act as both Stack and QueueIt is useful in many problems where we need to have a subset of all operations also like insert/remove at front and insert/remove at the end.It is typically implemented either using a doubly linked list or circular array.Implementations of Deque in Different Languagesdeque in C++Deque in Javadeque in PythonDeque in JavaScriptBelow are example programs in different languages. C++ #include <iostream> #include <deque> using namespace std; int main() { deque<int> dq; dq.push_back(10); dq.push_back(20); dq.push_front(30); // Print deque elements for (int x : dq) cout << x << " "; cout << endl; // Pop from front and back dq.pop_front(); dq.pop_back(); // Print deque elements after pop for (int x : dq) cout << x << " "; return 0; } Java import java.util.ArrayDeque; import java.util.Deque; public class Main { public static void main(String[] args) { Deque<Integer> dq = new ArrayDeque<>(); dq.addLast(10); dq.addLast(20); dq.addFirst(30); // Print deque elements for (int x : dq) System.out.print(x + " "); System.out.println(); // Pop from front and back dq.removeFirst(); dq.removeLast(); // Print deque elements after pop for (int x : dq) System.out.print(x + " "); } } Python from collections import deque dq = deque() dq.append(10) dq.append(20) dq.appendleft(30) # Print deque elements print(' '.join(map(str, dq))) # Pop from front and back dq.popleft() dq.pop() # Print deque elements after pop print(' '.join(map(str, dq))) C# using System; using System.Collections.Generic; class Program { static void Main() { Deque<int> dq = new Deque<int>(); dq.AddLast(10); dq.AddLast(20); dq.AddFirst(30); // Print deque elements foreach (int x in dq) Console.Write(x + " "); Console.WriteLine(); // Pop from front and back dq.RemoveFirst(); dq.RemoveLast(); // Print deque elements after pop foreach (int x in dq) Console.Write(x + " "); } } public class Deque<T> { private LinkedList<T> list = new LinkedList<T>(); public void AddFirst(T value) { list.AddFirst(value); } public void AddLast(T value) { list.AddLast(value); } public void RemoveFirst() { list.RemoveFirst(); } public void RemoveLast() { list.RemoveLast(); } public IEnumerator<T> GetEnumerator() { return list.GetEnumerator(); } } Deque BasicsArray Implementation of DequeLinked List Implementation of DequePractice Problems Based on DequeBasic ProblemsDifference between Queue and DequeDeque Implementation in PythonFirst and Last Elements of Deque in PythonAdd Element at Front of a DequeRemove an Element from Front of DequeMinimize Maximum Difference Between Adjacent ElementsEasy ProblemsRearrange Linked List to Alternate First and Last Substring with Maximum FrequencyPrefixes as Suffixes of a String Level order traversal in spiral formString after processing backspace charactersGenerate a Sequence by inserting positionsLexicographically largest permutation Check if Strings Can Be Made Equal Medium ProblemsStack and Queue Using ArrayDeque in JavaImplement Stack and Queue using DequeGenerate Bitonic Sequence Rearrange Array Elements Longest Subarray with Absolute Difference ≤ X Reverse a Linked List in groups Max Sum Subsequence with K Distant ElementsNth term of given recurrence relation Max Subarray Length with K Increments Largest String after Deleting K CharactersSegregate even and odd nodes in a Linked List Generate Permutation with Unique Adjacent Differences 0-1 BFS Min Deques to Sort Array Min Number by Applying + and * Operations Advertise with us Next Article Deque - Introduction and Applications K kartik Follow Similar Reads DSA Tutorial - Learn Data Structures and Algorithms DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on 7 min read Quick Sort QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s 12 min read Merge Sort - Data Structure and Algorithms Tutorials Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge 14 min read Data Structures Tutorial Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st 2 min read Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir 8 min read Breadth First Search or BFS for a Graph Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta 15+ min read Binary Search Algorithm - Iterative and Recursive Implementation Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc 15 min read Insertion Sort Algorithm Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. T 9 min read Array Data Structure Guide In this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous 4 min read Sorting Algorithms A Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ 3 min read Article Tags : Queue DSA cpp-deque deque Practice Tags : DequeQueue Like