Skip to content

Category Archives: Queue

A Queue is a linear data structure. This data structure follows a particular order in which the operations are performed. The order is First In… Read More
Geek is in a maze of size N * M. Each cell in the maze is made of either ‘.’ or ‘#’. An empty cell… Read More
Given a stack of M elements and a queue of N elements in sorted order. The task is to find out the common elements of… Read More
Given a connected acyclic graph with N nodes numbered from 1 to N and N-1 edges, find out the pair of nodes that are at… Read More
Given a stack St of M elements and a queue Q of N elements. The task is to put every element of stack into the… Read More
The push–relabel algorithm (alternatively, pre flow–push algorithm) is an algorithm for computing maximum flows in a flow network. Push-relabel algorithms work in a more localized… Read More
Given an array and a range [lowVal, highVal], partition the array around the range such that the array is divided into three parts.  All elements… Read More
Given a Binary Tree, the task is to find the difference of the sum of leaf nodes at the odd level and even level of… Read More
Pre-requisite: Maximum width of a Binary Tree with null value | Set 1 Given a Binary Tree consisting of N nodes, the task is to… Read More
Given an array arr[] of N integers and an integer K, the task is to find the sum of maximum of the array possible wherein… Read More
Given an array arr[] of size N, sorted based on the absolute value of its elements. The task is to sort this array based on… Read More
Given a numeric string target of length N and a set of numeric strings blocked, each of length N, the task is to find the… Read More
Given a numeric string target of length N and a set of numeric strings blocked, each of length N, the task is to find the… Read More
Given an array arr[] and an integer N, the task is to find the maximum number of pairs that can be formed such that ith… Read More
Given a binary array a[] and a number k, we need to find the length of the longest subsegment of ‘1’s possible by changing at… Read More

Start Your Coding Journey Now!