Given an integer k and array of length N find the min no of move to make all the elements divisible by k. In one move you can go one of the below operation. 1. For any index i we can do a[i] = a[i] + p 2. p = p + 1 The value of p starts… Read More »
You have to paint n boards of length {L1, L2, L3,…,Ln-1}. There are k painters available and each painter takes t time to paint 1 unit of board. You have to get this job done as soon as possible under the constraints that any painter will paint only contiguous sections of boards. 2 painters cannot share a board… Read More »
Prerequisite – What is Algorithm | Introduction to Algorithms Advantages of Divide and Conquer Solving difficult problems: Divide and conquer is an efficient method for solving difficult problems. For example, consider the Tower of Hanoi problem which reduces the degree of difficulty since it divides the problem into subproblems that are easily solvable, solving the trivial cases and… Read More »
There is an array arr[] of length N. Your task is to find the sum of the minimum elements of each possible sub-array of the array. Examples: Input : arr[] = {2, 4, 6, 8, 10} Output : 75 Explanation : Min of all sub-arrays: {2} – 2 {2, 4} – 2 {2, 4, 6} – 2 {2,… Read More »
Write an efficient C program to find the sum of contiguous subarray within a one-dimensional array of numbers which has the largest sum. Examples: Input : {-2, -3, 4, -1, -2, 1, 5, -3} Output : 7 The subarray {4,-1,-2,1,5} gives the maximum sum among all other possible sub-arrays. Algorithmic Paradigm: Divide And Conquer To apply Divide and… Read More »