Longest Remaining Time First (LRTF) CPU Scheduling Program
Prerequisite – CPU Scheduling | Longest Remaining Time First (LRTF) algorithm We have given some process with arrival time and Burst Time and we have… Read More »
Prerequisite – CPU Scheduling | Longest Remaining Time First (LRTF) algorithm We have given some process with arrival time and Burst Time and we have… Read More »
Given an integer and an integer array , the task is to find the minimum possible sum of all the elements of the array after… Read More »
Given N line segments where the length of the ith line segment is . The task is to find the maximum number of parallelograms can… Read More »
Given two integer arrays and where stores the ages of different students and an element of stores the number of candies that packet has (complete… Read More »
Given an array which represents the marks of students. The passing grade is and maximum marks that a student can score is , the task… Read More »
Given two integers and , the task is to find the sum of all the numbers within the range [1, n] excluding the numbers which… Read More »
Given a string . Find a string , where B is a palindrome and A is a subsequence of B. A subsequence of a string… Read More »
Given sum and gcd of two numbers and . The task is to find both the numbers a and b. If the numbers do not… Read More »
Given Rupees. A liter plastic bottle of water costs Rupees and a litre of glass bottle of water costs Rupees. But the empty glass bottle… Read More »
Given a binary array arr[] of zero’s and one’s only. The task is to find the minimum number of one’s to be changed to zero… Read More »
Given an array A[] of integers. The task is to count total subarrays whose sum is prime with ( size > 1 ). Examples: Input… Read More »
We are given an array of N integers, we need to partition the array into segments such that every element of a segment is greater… Read More »
Given an incomplete bracket sequence S. The task is to find the number of closing brackets ‘)’ needed to make it a regular bracket sequence… Read More »
Given an integer N. The task is to find the lexicographically smallest permutation of integer of the form: 12345…N such that no digit occurs at… Read More »
Given a function F(n) = P – (0.006 * n), where P is given. Given a list of integers and a number, . The task… Read More »