Given M servers that handle multiple requests having infinite computational capability and arrays arrivalTime[] and processTime[] of size N denoting the arrival time and load… Read More

# Category Archives: Queue

Given a binary string, str, two integer arrays R[], and C[] of size N. Flipping all the characters from index i to R[i] requires C[i]… Read More

Given a Binary Tree, the task is to check if it consists of node values arranged in strictly increasing order at even levels and strictly… Read More

Given a Binary Tree, the task is to check if the binary tree is an Even-Odd binary tree or not. A Binary Tree is called… Read More

Given two positive integers N and K and an array F[] consisting of K positive integers. The Nth term of the recurrence relation is given… Read More

Given an array arr[], the task is to print the array obtained by inserting elements of arr[] one by one into an initially empty array,… Read More

Given a graph G consisting of nodes valued [0, N – 1], a source S, and an array Edges[][3] of type {u, v, w} that… Read More

Given an array arr[] consisting of permutation in the range [1, N], the task is to check if the given array can be reduced to… Read More

Given an N-ary Tree consisting of nodes valued [1, N] and an array value[], where each node i is associated with value[i], the task is… Read More

Given an array arr[], where each element represents the maximum number of steps that can be made forward from that element, the task is to… Read More

Given a binary tree, the task is to traverse each level of the given binary tree from left to right and print every alternate encountered… Read More

Given a two dimensional array arr[][] of dimensions N * 2 which contains the starting and ending time for N meetings on a given day.… Read More

Given an N-ary Tree having N nodes with positive and negative values and (N – 1) edges, the task is to find the maximum absolute… Read More

Given an N-ary Tree rooted at 1, the task is to find the difference between the sum of nodes at the odd level and the… Read More