## Queue of Pairs in C++ STL with Examples

Queue in STL are a type of container adaptors which operate in a first in first out (FIFO) type of arrangement where elements are inserted… Read More »

- Minimize the maximum difference between adjacent elements in an array
- Real-time application of Data Structures
- Priority Queue of Vectors in C++ STL with Examples
- Priority queue of pairs in C++ with ordering by first and second element
- Queue of Pairs in C++ STL with Examples
- Find the K closest points to origin using Priority Queue
- Implementing Water Supply Problem using Breadth First Search
- What is a Webcrawler and where is it used?
- Design a Queue data structure to get minimum or maximum in O(1) time
- Important functions of STL Components in C++
- Boundary Level order traversal of a Binary Tree
- Diamond Tree
- Longest subarray whose elements can be made equal by maximum K increments
- Minimum circular rotations to obtain a given numeric string by avoiding a set of given strings
- Length of Smallest Subsequence such that sum of elements is greater than equal to K
- Sum and product of K smallest and largest Fibonacci numbers in the array
- Print all Exponential Levels of a Binary Tree
- Static and Dynamic data structures in Java with Examples
- Check if cells numbered 1 to K in a grid can be connected after removal of atmost one blocked cell
- CPU Scheduling in Operating Systems using priority queue with gantt chart
- Append the elements of queue in mirror-inverse order
- Maximum absolute difference between any two level sum in a Binary Tree
- Minimum difference between maximum and minimum value of Array with given Operations
- Clockwise Triangular traversal of a Binary Tree
- Find integral points with minimum distance from given set of integers using BFS
- Minimum possible modifications in the matrix to reach destination
- Array value by repeatedly replacing max 2 elements with their absolute difference
- Nth positive number whose absolute difference of adjacent digits is at most 1
- Different Types of Queues and its Applications
- Print Nth Stepping or Autobiographical number

Queue in STL are a type of container adaptors which operate in a first in first out (FIFO) type of arrangement where elements are inserted… Read More »

Given a Binary Tree, the task is to print all palindromic levels of this tree. Palindrom Level Any level of a Binary tree is said… Read More »

Pre-requisites: Java Collection Framework. 1. What is the Output of following Java Program? filter_none edit close play_arrow link brightness_4 code import java.util.*; class Demo… 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 »