Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
-
Economics & Finance
Articles by Narendra Kumar
Page 16 of 18
Minimum number of operations on an array to make all elements 0 using C++.
Problem statementGiven an array of size N and each element is either 1 or 0. The task is to calculated the minimum number of operations to be performed to convert all elements to zero. One can perform below operations −If an element is 1, You can change its value equal to 0 then −If the next consecutive element is 1, it will automatically get converted to 0If the next consecutive element is already 0, nothing will happen.If arr[] = {1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1} then 4 operation are required to ...
Read MoreMinimum number of nodes in an AVL Tree with given height using C++.
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 to maintain the height balance property, i.e. a difference in the height of the left and the right subtrees cannot be more than -1, 0 or 1 for each node. Using this property, we can create below recurrence relation −1. If height = 0 then return 1 2. If height ...
Read MoreMinimum number of mails required to distribute all the questions using C++.
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 know about all the questionsIf N = 3, K = 3, X = 1 then one has to send 6 mails −Student 1 sends his question to student 2 and student 3 (2 mails), So does student 2 and student 3 so total mails = 2 * 3 = 6AlgorithmThe ...
Read MoreMinimum number of letters needed to make a total of n in C++.
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 3(26 + 26 + 20)Algorithm1. If n is divisible by 26 then answer is (n/26) 2. If n is not divisible by 26 then answer is (n/26) + 1Example#include using namespace std; int minRequiredSets(int n){ if (n % 26 == 0) { return (n / 26); } else { return (n / 26) + 1; } } int main(){ int n = 72; cout
Read MoreMinimum number of items to be delivered using C++.
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 items needed to be delivered per tour so that all of the items can be delivered within K tours.If there are 5 buckets with item = {1, 3, 5, 7, 9} and 10 tours then we can deliver 3 items per tour By delivering 3 items at a time, 1st ...
Read MoreMinimum number of given operations required to make two strings equal using C++.
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 operations −If _ is at a position I then _ can be swapped with a character at position i+1 or i-1If characters at positions i+1 and i+2 are different then _ can be swapped with a character at position i+1 or i+2Similarly, if characters at positions i-1 and i-2 are ...
Read MoreMinimum number of given moves required to make N divisible by 25 using C++.
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 it is not possible to make N divisible by 25 then print -1If N = 5071 then 4 moves are required to make it divisible by 255071 → 5701 → 7501 → 7510 → 7150Algorithm1. Iterate over all pairs of digits in the number. Let the first digit in the ...
Read MoreMinimum number of elements to be removed to make XOR maximum using C++.
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 is zero 2. Find a number which is power of 2 and greater than or equal to. Let us call this number as nextNumber 2.1. If n == nextNumber or n == (nextNumber – 1) then answer is 1 2.2. If n = (nextNumber -2) then answer is ...
Read MoreMinimum number of elements to add to make median equals x using C++.
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 sort the elements in the non-decreasing order. For example, in below array median is 20 −arr1[] = {10, 20, 30, 40}If arr[] = {1, 2, 3} and x = 4 then we have to add 4 number i.e. {4, 5, 5, 5} in array to make median equal to 4AlgorithmThe ...
Read MoreMinimum number of elements that should be removed to make the array good using C++.
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] + a[j] is a power of two.arr1[] = {1, 1, 7, 1, 5}In above array if we delete element ‘5’ then array becomes good array. After this any pair of arr[i] + arr[j] is power of two −arr[0] + arr[1] = (1 + 1) = 2 which power of twoarr[0] ...
Read More