GeeksforGeeks

Why Doesn't std::queue::pop Return Value?

Last Updated: 24 July 2024

In C++, we use std::queue which is a container adapter in the standard template library (STL) and is used for managing a collection of elements in a FIFO (first-in, first-...read more

How to Implement a Circular Buffer Using std::vector?

Last Updated: 03 April 2025

A circular buffer, also known as a cyclic buffer or ring buffer, is a data structure that uses a single, fixed-size buffer as if it were connected end-to-end. In this arti...read more

How to Create a Stack of Queue in C++?

Last Updated: 13 March 2024

In C++, the std::stack is a container that follows the LIFO (Last In, First Out) rule, whereas std::queue is a container that follows the FIFO (First In, First Out) rule. ...read more

How to Enqueue an Element into a Queue in C++?

Last Updated: 04 March 2024

In C++ STL, we have a queuecontainer that simulates the queue data structure and follows the FIFO (First In, First Out) rule. In this article, we will learn how to enqueue...read more

How to Push All Elements from a Vector to a Queue in C++?

Last Updated: 09 February 2024

In C++, vectors are dynamic arrays while the queue is a data structure that follows the FIFO (First In First Out) property. In this article, we will learn how to push all ...read more

C++ STL - Reverse Priority Queue

Last Updated: 02 November 2022

A priority Queue is an abstract data type that resembles a queue, and each element has a corresponding priority value. Priority queues are built on the top of the max heap...read more

Technical Scripter 2022

How to Iterate a STL Queue in C++?

Last Updated: 06 February 2023

A Queue is a linear structure that follows a particular order in which the operations are performed. The order is First In First Out (FIFO).Syntax:queuedatatype queuename;...read more

Minimum length paths between 1 to N including each node

Last Updated: 09 February 2023

Given an undirected graph consisting of N nodes and M edges, the task is to find the minimum length of the path from Node 1 to Node N passing from every possible node of t...read more

Number of minimum length paths between 1 to N including each node

Last Updated: 16 February 2023

Given an undirected and unweighted graph of N nodes and M edges, the task is to count the minimum length paths between node 1 to N through each of the nodes. If there is d...read more

Queries to find number of connected grid components of given sizes in a Matrix

Last Updated: 09 February 2023

Given a matrix mat[][] containing only of 0s and 1s, and an array queries[], the task is for each query, say k, is to find the number of connected grid components (cells c...read more

Design Front Middle Back Queue using STL

Last Updated: 04 August 2021

Design a data structure that supports the following operations in queue efficiently:push__front(x): Insert an element at the front of the queue.push__middle(x): Inserts el...read more

Linked List

Queue

Competitive Programming

Advantages of circular queue over linear queue

Last Updated: 18 March 2021

Linear Queue: A Linear Queue is generally referred to as Queue. It is a linear data structure that follows the FIFO (First In First Out) order. A real-life example of a qu...read more

Technical Scripter 2020

DSA

Find a set of at most N/2 nodes from a Graph such that all remaining nodes are directly connected to one of the chosen nodes

Last Updated: 07 March 2023

Given an integer N, representing the number of nodes present in an undirected graph, with each node valued from 1 to N, and a 2D array Edges[][], representing the pair of ...read more

Minimum bridges required to be crossed to reach N<sup>th</sup> city

Last Updated: 27 May 2021

Given an integer N denoting the number of connected cities ( numbered from 1 to N ) and a 2D array arr[][] consisting of pairs connected to each other by bidirectional bri...read more

interview-preparation

BFS

Algorithms-Graph Traversals

cpp-queue

DSA

Minimum time required to fill given N slots

Last Updated: 10 October 2023

Given an integer N which denotes the number of slots, and an array arr[] consisting of K integers in the range [1, N] . Each element of the array are in the range [1, N] w...read more