cpp-deque

40+ posts

Similar Topics

DSA

21k+ articles

Difference Between

4.3k+ articles

C++

2.8k+ articles

STL

900+ articles

CPP-Functions

560+ articles

Queue

340+ articles

CPP-Library

250+ articles

cpp-containers-library

40+ articles

deque

40+ articles

cpp-deque-functions

7+ articles

deque insert() function in C++ STL

Last Updated: 14 June 2022

The deque::insert() function is a built-in function in C++ which is used to insert elements in the deque. The insert() function can be used in three ways:Extends deque by ...read more

deque::push_back() in C++ STL

Last Updated: 06 October 2021

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

STL

C++

cpp-deque

deque::push_front() in C++ STL

Last Updated: 22 January 2018

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

STL

C++

cpp-deque

deque::begin() and deque::end in C++ STL

Last Updated: 27 June 2023

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

STL

C++

cpp-deque

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

deque::at() and deque::swap() in C++ STL

Last Updated: 27 June 2023

Deque or Double ended queues are sequence containers with the feature of expansion and contraction on both the ends. They are similar to vectors, but are more efficient in ...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::empty() and deque::size() in C++ STL

Last Updated: 23 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 cas ...read more

STL

CPP-Library

C++

cpp-containers-library

cpp-deque

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

STL

CPP-Library

C++

cpp-containers-library

cpp-deque

deque

deque::pop_front() and deque::pop_back() in C++ STL

Last Updated: 23 June 2022

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

STL

CPP-Library

C++

cpp-containers-library

cpp-deque

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

STL

C++

cpp-containers-library

cpp-deque

deque

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

1 2 3 >>

1 2 3 >>

1 2 3 >>