Double Ended Queue(Deque)
A deque is a very useful data structure as it provides all functionalities that a stack and a queue do. It is a linear data structure that has a front and a rear. It can remove and insert elements from both ends.
Implement dynamic Deque using templates class and a circular array
By Aditya Narayan Joardar
● Published At Nov 2021
This article discusses how to implement dynamic Deque using templates class and a circular array.... Keep reading ..
Design Front Middle Back Queue using STL
By Rhythm Jain
● Published At Dec 2021
This article discusses how to design Front Middle Back Queue using STL... Keep reading ..
Implementation of Deque Using Doubly Linked List
By Aman Chourasiya
● Published At Nov 2021
Deque, or Double Ended Queue, is a popular data structure that extends the functionality of Queue data structure. It supports operations at both of its ends.... Keep reading ..
Generate a permutation of first N natural numbers having count of unique adjacent differences equal to K
By Shreya Deep
● Published At Dec 2021
In this article, we will learn how to solve the problem of finding a permutation of n numbers such that the number of unique differences between adjacent numbers is equal to k... Keep reading ..
Array obtained by repeatedly reversing array after every insertion from the given array
By Nishant Rana
● Published At Feb 2022
In this article, we will solve the coding problem of getting the Array by repeatedly reversing the array after every insertion from the given array. ... Keep reading ..