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 Arnab Chakraborty
Page 339 of 377
C++ program to find two numbers from two arrays whose sum is not present in both arrays
Suppose we have two arrays A with n elements and B with m elements. Select some element a form A and some element b from B, such that a + b does not belong to A or B.So, if the input is like A = [3, 2, 2]; B = [1, 5, 7, 7, 9], then the output will be [3, 1], because 3 + 1 = 4 is not present in any array. (Other answers are also available)StepsTo solve this, we will follow these steps −sort the array A sort the array B return last element of A and ...
Read MoreC++ program to find maximum possible value of XORed sum
Suppose we have an array A with N elements and another value K. For an integer X in range 0 to K, let f(X) = (X xor A[1]) + (X xor A[2]) + ... + (X xor A[N]). We have to find the maximum possible value of f.So, if the input is like K = 7; A = [1, 6, 3], then the output will be 14, because f(4) = (4 XOR 1) + (4 XOR 6) + (4 XOR 3) = 5 + 2 + 7 = 14.StepsTo solve this, we will follow these steps −n := size of ...
Read MoreC++ program to count at least how many operations needed for given conditions
Suppose we have an array A with N elements. In each operation, we pick an element and increase or decrease it by 1. We have to find at least how many operations are needed to satisfy following conditions −For every i in range 1 to n, the sum of the terms from 1st through ith term is not 0For every i in range 1 to n - 1, the sign of the terms from the 1st through ith term is different from sign of the sum of the terms from the 1st through (i+1)th term.So, if the input is like ...
Read MoreC++ program to find permutation for which sum of adjacent elements sort is same as given array
Suppose we have an array A with n elements. A function F(p) is a sorted array of sums of adjacent elements in p. So F(p) = sort([p1 + p2, p2 + p3, ... pn-1 + pn]). We have a permutation represented in A. We have to find the different permutation of A where F(A) is same.So, if the input is like A = [2, 1, 6, 5, 4, 3], then the output will be [1, 2, 5, 6, 3, 4], because F(A)=sort([2+1, 1+6, 6+5, 5+4, 4+3]) = sort([3, 7, 11, 9, 7]) = [3, 7, 7, 9, 11]. And sort([1+2, ...
Read MoreC++ program to find smallest and largest number of children in game before start
Suppose we have an array A with K number of elements. Consider, in a game there are N players and a game master is there. This game has K rounds. In ith round game master announces to form groups with A[i] number of children. Then the remaining children form as many groups of A[i] children as possible. One child cannot take part into multiple groups. Those who are left without a group leave the game. The others proceed to the next round. A round may have with no player loss. In the end, after the K-th round, there are exactly ...
Read MoreC++ program to find number of l-r pairs for which XORed results same as summation
Suppose we have an array A with N elements. We have to find the number of pairs of integers l and r that satisfies A[l] XOR A[l+1] XOR ... XOR A[r-1] XOR A[r] = A[l] + A[l+1] + ... A[r].So, if the input is like A = [2, 5, 4, 6], then the output will be 5, because for pairs (1,1), (2,2), (3,3), (4,4) and (1,2).StepsTo solve this, we will follow these steps −n := size of A Define some arrays of size (n + 1) each, a, s and sx for initialize i := 1, when i
Read MoreC++ program to find how many characters should be rearranged to order string in sorted form
Suppose we have a string S with n characters. S contains lowercase letters only. We must select a number k in range 0 to n, then select k characters from S and permute them in any order. In this process, the remaining characters will remain unchanged. We perform this whole operation exactly once. We have to find the value of k, for which S becomes sorted in alphabetical order.So, if the input is like S = "acdb", then the output will be 3, because 'a' is at the correct place and remaining characters should be rearranged.StepsTo solve this, we will ...
Read MoreC++ program to count how many minutes we have to wait to meet at least one swimmer
Suppose we have four numbers p, a, b and c. There is a pool and three swimmers are there. They take a, b and c minutes to cross the pool and come back, respectively. So the first swimmer will be at the left side of pool after 0, a, 2a, 3a, ... minutes after the start time. The second will be at 0, b, 2b, 3b, ... minutes and for the third one 0, c, 2c, 3c, ... If we visit the pool after p minutes they have started swimming we have to find how much time we have to ...
Read MoreC++ program to check we can rearrange array in such a way that given formula returns m or not
Suppose we have an array A with n elements and another number m. We have to check whether we can rearrange the array in such a way that$$\mathrm{\sum_{i=1}^{n} \sum_{j=1}^{n}\frac{A[j]}{j} = m}$$There will be no rounding in A[j]/j operation.So, if the input is like A = [2, 5, 1]; m = 8, then the output will be True, because for the arrangement of [1, 2, 5], (1/1 + 2/2 + 5/3) + (2/2 + 5/3) + (5/3) = 8stepsTo solve this, we will follow these steps −sum := 0 n := size of A for initialize i := 0, when i ...
Read MoreC++ program to find largest or equal number of A whose sum of digits is divisible by 4
Suppose we have a number A. We have to find nearest larger or equal interesting number for A. A number is said to be interesting number if its sum of digits is divisible by 4. So, if the input is like A = 432, then the output will be 435, because 4 + 3 + 5 = 12 which is divisible by 4.StepsTo solve this, we will follow these steps −while (A / 1000 + A mod 1000 / 100 + A mod 100 / 10 + A mod 10) mod 4 is not equal to 0, do: (increase A ...
Read More