## 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 »

## Minimum sum of squares of character counts in a given string after removing k characters

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 »

## First negative integer in every window of size k

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 »

## Level order traversal line by line | Set 2 (Using Two Queues)

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 »

## MakeMyTrip Interview Experience | Set 14 (For Senior Android developer)

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 »

## Applications of Priority Queue

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 »

## Circular Queue | Set 2 (Circular Linked List Implementation)

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 »

## Circular Queue | Set 1 (Introduction and Array Implementation)

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 »

## Paytm Interview Experience | Set 12 (For 1.5 Years Experienced)

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 »

## Implementation of Deque using circular array

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 »

## Distance of nearest cell having 1 in a binary matrix

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 »

## Minimum steps to reach target by a Knight | Set 1

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 »

## Sum of minimum and maximum elements of all subarrays of size k.

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 »

## Minimum sum of two numbers formed from digits of an array

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 »

## Find maximum level sum in Binary Tree

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