# Category Archives: Queue

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
Prerequisite – Circular Singly Linked List We have discussed basics and how to implement circular queue using array in set 1. Circular Queue | Set… Read More
Prerequisite – QueuesCircular Queue is a linear data structure in which the operations are performed based on FIFO (First In First Out) principle and the… Read More
I want to share my interview experience with Paytm with all of you. Round-1 [1.5 hr] Brief introduction Discussion about project why are you using… Read More
Deque or Double Ended Queue is a generalized version of Queue data structure that allows insert and delete at both ends.In previous post we had… Read More