Similar Topics

20.6k+ articles

7.6k+ articles

6.3k+ articles

3.1k+ articles

2.7k+ articles

2k+ articles

1k+ articles

900+ articles

340+ articles

40+ articles

deque

40+ posts

Popular articles

Recent articles

Difference between Queue and Deque in C++

Last updated: 20 June 2022

Queue: A Queue is a linear data structure that follows a First In First Out (FIFO) order in which the operations are performed. It is a type of container adaptor where ele...read more

Difference Between

How to get the first and last elements of Deque in Python?

Last updated: 01 October 2020

Deque is a Double Ended Queue which is implemented using the collections module in Python. Let us see how can we get the first and the last value in a Deque.Method 1: Acce ...read more

Python collections-module

Minimize the maximum difference between adjacent elements in an array

Last updated: 04 July 2022

Given a non-decreasing array arr[] and an integer K, the task is to remove K elements from the array such that maximum difference between adjacent element is minimum.Note: ...read more

Competitive Programming

Data Structures

Similar Topics

20.6k+ articles

7.6k+ articles

6.3k+ articles

3.1k+ articles

2.7k+ articles

2k+ articles

1k+ articles

900+ articles

340+ articles

40+ articles

String after processing backspace characters

Last updated: 07 September 2022

Given a string S containing letters and '#'. The '#" represents a backspace. The task is to print the new string without '#'.Examples:Input : S = "abc#de#f#ghi#jklmn#op#"O ...read more

Rearrange a linked list in to alternate first and last element

Last updated: 24 February 2023

Given a linked list. arrange the linked list in manner of alternate first and last element.Examples:Input : 1-2-3-4-5-6-7-8Output :1-8-2-7-3-6-4-5Input :10-11-15-13Output ...read more

Implement Stack and Queue using Deque

Last updated: 28 December 2022

Deque also known as double ended queue, as name suggests is a special kindof queue in which insertions and deletions can be done at the last as wellas at the beginning.A l...read more

deque::clear() and deque::erase() in C++ STL

Last updated: 30 June 2022

Deque or Double-ended queues are sequence containers with the feature of expansion and contraction on both ends. They are similar to vectors, but are more efficient in the ...read more

Deque::front() and deque::back() in C++ STL

Last updated: 11 September 2023

Deque or Double Ended queues are sequence containers with the feature of expansion and contraction on both ends. They are similar to vectors, but are more efficient in cas ...read more

cpp-containers-library

Implementation of Deque using doubly linked list

Last updated: 10 January 2023

Deque or Double Ended Queue is a generalized version of Queue data structure that allows insert and delete at both ends. In previous post Implementation of Deque using cir...read more

0-1 BFS (Shortest Path in a Binary Weight Graph)

Last updated: 05 September 2023

Given a graph where every edge has weight as either 0 or 1. A source vertex is also given in the graph. Find the shortest path from the source vertex to every other vertex...read more

Implementation of Deque using circular array

Last updated: 21 September 2022

Implement a deque Using a circular array:Deque or Double Ended Queue is a generalized version of the Queue data structure that allows insert and delete at both endsOperati...read more

circular linked list

Deque interface in Java with Example

Last updated: 10 April 2023

Deque interface present in java.util package is a subtype of the queue interface. The Deque is related to the double-ended queue that supports the addition or removal of e...read more

Java-Collections

Deque in Python

Last updated: 06 March 2023

Deque (Doubly Ended Queue) in Python is implemented using the module "collections". Deque is preferred over a list in the cases where we need quicker append and pop operat...read more

Python collections-module

Python-Data-Structures

Deque in C++ Standard Template Library (STL)

Last updated: 20 June 2023

Double-ended queues are sequence containers with the feature of expansion and contraction on both ends.They are similar to vectors, but are more efficient in case of inser ...read more

cpp-containers-library

Deque | Set 1 (Introduction and Applications)

Last updated: 18 March 2023

Deque or Double Ended Queue is a generalized version of Queue data structure that allows insert and delete at both ends.Operations on Deque: Below is a table showing some ...read more