## Reversing a Queue

Give an algorithm for reversing a queue Q. Only following standard operations are allowed on queue. enqueue(x) : Add an item x to rear of… Read More »

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

Give an algorithm for reversing a queue Q. Only following standard operations are allowed on queue. enqueue(x) : Add an item x to rear of… Read More »

Given an integer k and a queue of integers, we need to reverse the order of the first k elements of the queue, leaving the… Read More »

Given two n-ary trees, the task is to check if they are mirror of each other or not. Print “Yes” if they are mirror of… Read More »

Given two binary trees, we have to check if each of their levels are anagrams of each other or not. Example: Tree 1: Level 0… Read More »

Coding Round: A variation of Knapsack Easy string manipulation problem A brute-force based string matching problem Technical Round 1: Finding the length of a Linked-List… Read More »

A stack permutation is a permutation of objects in the given input queue which is done by transferring elements from input queue to the output… Read More »

Given a non-empty binary tree, print the average value of the nodes on each level. Examples: Input : 4 / \ 2 9 / \… Read More »

Given a stream of characters and we have to find first non repeating character each time a character is inserted to the stream. Examples: Input… Read More »

Round I 1.Implement expiry cache system : every page in cache have id and expiry time (TTL of few seconds). After page expires it behaves… Read More »

Prerequisite : Page Replacement Algorithms In operating systems that use paging for memory management, page replacement algorithm are needed to decide which page needed to… Read More »

Given a string of lowercase alphabets and a number k, the task is to print the minimum value of the string after removal of ‘k’… Read More »

Given an array and a positive integer k, find the first negative integer for each window(contiguous subarray) of size k. If a window does not… Read More »

Given a Binary Tree, print the nodes level wise, each level on a new line. Output: 1 2 3 4 5 Recommended: Please solve it… Read More »

Senior Android developer(4-8 years) Qualification & Experience- · 4-8 years of experience in software development · Experience in Mobile App development in Android is a… Read More »

A Priority Queue is different from a normal queue, because instead of being a “first-in-first-out”, values come out in order by priority. It is an… Read More »