Programming Articles - Page 2353 of 3363

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 More

JSON Schema is a specification for JSON based format for defining the structure of JSON data. The JsonSchema class can provide a contract for what JSON data is required for a given application and how to interact with it. The JsonSchema can define validation, documentation, hyperlink navigation, and interaction control of JSON data. We can generate the JSON schema using the generateSchema() method of JsonSchemaGenerator, this class wraps the JSON schema generation functionality.Syntaxpublic JsonSchema generateSchema(Class type) throws com.fasterxml.jackson.databind.JsonMappingExceptionExampleimport com.fasterxml.jackson.core.JsonProcessingException; import com.fasterxml.jackson.databind.ObjectMapper; import com.fasterxml.jackson.module.jsonSchema.JsonSchema; import com.fasterxml.jackson.module.jsonSchema.JsonSchemaGenerator; import java.util.List; public class JSONSchemaTest {    public static void main(String[] args) throws JsonProcessingException {     ... 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 minimum number of moves needed to make all elements of the array equal. Print -1 if it is not possibleIf arr[] = {1, 2, 3, 4, 5, 6} and k = 6 then minimum 5 moves are required: Move-1: {2, 3, 4, 5, 6, 6} Move-2: {3, 4, 5, 6, ... 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 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 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 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

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 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 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 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 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 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 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 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 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 More