## Program for Page Replacement Algorithms | Set 2 (FIFO)

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 »

- Zig Zag Level order traversal of a tree using single queue
- Minimum steps to reach any of the boundary edges of a matrix | Set-2
- Check if it is possible to reach a number by making jumps of two given length
- Array implementation of queue (Simple)
- Minimum number of given operations required to make two strings equal
- FIFO (First-In-First-Out) approach in Programming
- Print all nodes between two given levels in Binary Tree
- Iterative Method To Print Left View of a Binary Tree
- K-th Greatest Element in a Max-Heap
- Minimum distance to the end of a grid from source
- Iterative Letter Combinations of a Phone Number
- Shortest Path using Meet In The Middle
- Difference between Stack and Queue Data Structures
- Bank Of America (BA Continuum India Pvt. Ltd.) Campus Recruitment
- Check if Queue Elements are pairwise consecutive
- Check if moves in a stack or queue are possible or not
- Canonical Huffman Coding
- Check if N is divisible by a number which is composed of the digits from the set {A, B}
- Nth number made up of odd digits only
- Difference between a Static Queue and a Singly Linked List
- Check if Queue Elements are pairwise consecutive | Set-2
- Reverse Cuthill Mckee Algorithm
- String after processing backspace characters

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 and every window(contiguous subarray) of size k. If a window… 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 – Queues Circular Queue is a linear data structure in which the operations are performed based on FIFO (First In First Out) principle and… Read More »

I want to share my interview experience with paytm with all of you. Round-1 [1.5 hr] 1. Brief introduction 2. Discussion about project 3. why… 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 »

Given a binary matrix of N x M, containing at least a value 1. The task is to find the distance of nearest 1 in… Read More »

Given a square chessboard of N x N size, the position of Knight and position of a target is given. We need to find out… Read More »

Given an array of both positive and negative integers, the task is to compute sum of minimum and maximum elements of all sub-array of size… Read More »

Given an array of digits (values are from 0 to 9), find the minimum possible sum of two numbers formed from digits of the array.… Read More »

Given a Binary Tree having positive and negative nodes, the task is to find maximum sum level in it. Examples: Input : 4 / \… Read More »