Server Side Programming Articles - Page 1891 of 2650

In this problem, we are given two vessels with capacities x and y and a supply of infinite water. Our task is to create a program that will be able to calculate exactly 1 liter in one vessel. Given the condition that x and y are co-primes. Co-primes also is known as relatively prime, mutually prime are numbers two numbers that have 1 as their only common divisor. So, this implies that their gcd(greatest common divisor) is 1.Here, let’s suppose we have two vessels V1 with capacity x and V2 with capacity y. To measure 1 liter using these two ... Read More

In this problem, we are given an array of n integers and some m querries. Our task is to create a program that calculates the integral value(round down) of the mean of the ranges given by the querries.Let’s take an example to understand the problem, Input −array = {5, 7, 8, 9, 10} m = 2; [0, 3], [2, 4]Output −7 9To solve this problem, we have two methods one is direct and the other is using prefix sum.In the direct approach, for each query, we will loop from the start index to the end index of the range. And ... Read More

In this problem, we are given a 2D array of size n*n. Our task is to create a program that will print the mean and median of the matrix in C++.Mean is the average of the date set. In a matrix mean is the average of all elements of the matrix.Mean = (sum of all elements of the matrix)/(number of elements of the matrix)Median is the middlemost element of the sorted data set. For this, we will have to sort the elements of the matrix.Median is calculated as, If n is odd, median = matrix[n/2][n/2]If n is even, median = ... Read More

In this problem, we are given a matrix of size n X n. Our task is to create a program that will calculate the maximum XOR value of a complete row or a complete column.Let’s take an example to understand the problem, Input −N = 3 mat[N][N] = {{4, 9, 1} {2, 8, 3} {10, 12, 11}}Output −13Explanation −Row1: 4^9^1 = 12 Row2: 2^8^3 = 9 Row3: 10^12^11 = 13 Col1: 4^2^10 = 12 Col2: 9^8^12 = 13 Col3: 1^3^11 = 9Here, we have calculated the XOR of all rows and columns and then the maximum of them is printed.To ... Read More

Problem statementGiven a range [L, R], we need to find two integers in this range such that their XOR is maximum among all possible choices of two integersIf the given range is L = 1 and R = 21 then the output will be 31 as − 31 is XOR of 15 and 16 and it is maximum within range.Algorithm1. Calculate the (L^R) value 2. From most significant bit of this value add all 1s to get the final resultExample#include using namespace std; int getMaxXOR(int L, int R){    int LXR = L ^ R;    int msbPos = ... Read More

In this problem, we are given two positive integers n and k. Our task is to find maximum xor between 1 to n using maximum X numbersLet’s take an example to understand the problem, Input − n = 5, k = 2Output − 7Explanation −elements till 5 is 1, 2, 3, 4, 5 Selecting all XOR pairs: 1^2 = 3, 1^3 = 2, 1^4 = 5, 1^5 = 4 2^3 = 4, 2^4 = 6, 2^5 = 7 3^4 = 7, 3^5 = 6 4^5 = 1 The maximum here is 7.To solve this problem, the maximum XOR can be ... Read More

Problem statementGiven a binary tree, write a function to get the maximum width of the given tree. The width of a tree is the maximum of widths of all levels.Consider below tree −      10      / \     7   4    / \   \   9   2   1          / \         2   5 1. Width at level 1: 1 2. Width at level 2: 2 3. Width at level 3: 3 4. Width at level 4: 2 For above tree answer is 3.Algorithm1. Use ... Read More

Problem statementGiven a string consisting of only A’s and B’s. We can transform the given string to another string by toggling any character. Thus many transformations of the given string are possible. The task is to find the Weight of the maximum weight transformation.Weight of a sting is calculated using below formula −Weight of string = Weight of total pairs + weight of single characters - Total number of toggles.Two consecutive characters are considered a pair only if they are different.Weight of a single pair (both characters are different) = 4Weight of a single character = 1If the input string ... Read More

In this problem, we are given an integer n and a matrix of size n X n which contains the weight of the cell. Our task is to create a program that will find the maximum weight path ending at any element of the last row in a matrix. While finding the path the traversal will start from top-left (0, 0) and the valid moves will be down and diagonal, no left move is allowed.Let’s take an example to understand the problem, Input −n = 3 Mat[3][3] ={    {4, 3, 1}    {5, 8, 9}    {6, 7, 2}}Output  ... Read More

In this problem, we are given an array of integers. Our task is to create the maximum value of XOR among all triplets of an array.Let’s take an example to understand the problem, Input − array = {5, 6, 1, 2}Output − 6Explanation −All triplets are: 5^6^1 = 2 5^6^2 = 1 5^1^2 = 6 6^1^2 = 5To solve this problem, a direct approach will be to find the XOR of all possible triplets and print the maximum of all triplets. This will not be effective if we work with an array with a huge number of elements in the ... Read More