## Priority Queue of Vectors in C++ STL with Examples

Priority Queue in STL Priority queues are a type of container adapters, specifically designed such that the first element of the queue is the greatest… Read More »

Priority Queue in STL Priority queues are a type of container adapters, specifically designed such that the first element of the queue is the greatest… Read More »

Given a binary tree, the task is to print all the nodes except the rightmost in every level of the tree. The root is considered… Read More »

Given two queues A and B, each of size N, the task is to find the minimum time taken to execute the tasks in A… Read More »

Given a binary string str consisting of only 0’s and 1’s. The following two operations can be performed on it: One digit can delete another… Read More »

Given an array arr[] of size N and a number K, the task is to find the length of the smallest subsequence such that the… Read More »

Given an array arr[] of size N, the task is to print the arrangement of the array such that upon performing following operations on this… Read More »

Given a Binary Tree, the task is to print spiral order traversal of the given tree. For below tree, the function should print 1, 2,… Read More »

Given an N * M matrix mat[][] consisting of lower case characters, the task is to find the minimum cost to reach from the cell… Read More »

Given a string S of length N consisting of lower case character, the task is to find the minimum cost to reach from index i… Read More »

Given an array of infinite length and two integers M and N which are co-primes, the task is to find the number of positions that… Read More »

Given a tree with N vertices numbered from 0 to N – 1 and Q query containing nodes in the tree, the task is to… Read More »

Given a dictionary, and two words start and target (both of the same length). Find length of the smallest chain from start to target if… Read More »

Given a binary array arr[], the task is to design a data structure that supports the following operations in O(1). Type 1: Remove and print… Read More »

Like stack, queue is a linear data structure that stores items in First In First Out (FIFO) manner. With a queue the least recently added… Read More »

Given a range [L, R], the task is to find the count of numbers from this range that satisfy the below conditions: All the digit… Read More »