Problem statementGiven the height of an AVL tree, the task is to find the minimum number of nodes the tree can have.If height = 0 then AVL tree can have one 1 node If height = 5 then AVL tree can have minimum 20 nodesAlgorithmIn an AVL tree, we have ... Read More

Problem statementGiven an array of N elements and an integer K., It is allowed to perform the following operation any number of times on the given array −Insert the Kth element at the end of the array and delete the first element of the array.The task is to find the ... Read More

Problem statementGiven N questions in a test and K students in the class. Out of the batch of K students, N students memorized exactly one question each. A mail can contain about a maximum of X questions.Find the minimum number of mails required so that the entire class gets to ... Read More

Problem statementGiven an integer n and let a = 1, b = 2, c= 3, ….., z = 26. The task is to find the minimum number of letters needed to make a total of nIf n = 23 then output is 1 If n = 72 then output is ... Read More

Problem statementGiven an array of size, N represents buckets, each array index containing items. Given K tours within which all of the items are needed to be delivered. It is allowed to take items from only one bucket in 1 tour. The task is to tell the minimum number of ... Read More

Problem statementGiven two strings str1 and str2, both strings contain characters ‘a’ and ‘b’. Both strings are of equal lengths. There is one _ (empty space) in both the strings. The task is to convert the first string into the second string by doing the minimum number of the following ... Read More

Problem statementGiven a number N without leading zeros. The task is to find the minimum number of moves required to make N divisible by 25. At each move, one can swap any two adjacent digits and make sure that at any time number must not contain any leading zeros. If ... Read More

Problem statementGiven a number N. The task is to find the minimum number of elements to be removed in between to N such that the XOR obtained from the remaining elements is maximum.Algorithm1. If n is 1 or 2 then there is no need to remove any element. Hence answer ... Read More

Problem statementGiven an array “arr” of size n and element x, the task is to find a minimum number of elements to be added in array to make median equals x.A median in an array with the length of n is an element which occupies position number (n-1)/2 after we ... Read More

Problem statementGiven an array “arr”, the task is to find the minimum number of elements to be removed to make the array good.A sequence a1, a2, a3. . .an is called good if for each element a[i], there exists an element a[j] (i not equals to j) such that a[i] ... Read More