Server Side Programming Articles - Page 1645 of 2646

We are given with the task to show the working of iswprint( ). The iswprint( ) function in C++ STL is used to check that whether the given wide character can be printed or not. It is a function present in cwctype header file in C++. Wide characters is a computer character datatype that generally has a size greater than the traditional 8-bit character.Syntaxint iswprint(c);Parameterc – This is a parameter which specifies the wide character that has to be checked whether it is printable or not.Return ValueThis function returns a non-zero value if c can be printed. It will return ... Read More

Given is the task to split the sentence into words. In this, we will separate all the words present in sentence.Input I am a good boyOutput I am a good boyIn the above example we will print the single word in single line.Example#include #include #include Using namespace std; void split( string st){    String word = “ “;    for ( char s : st){       If (s== ‘ ‘){          Cout

Given is the task to find the working of sqrt() function for complex number. Basically the sqrt( ) is a function present in complex header file. This function is used to calculate the square root of complex number.Syntaxtemplate complex Sqrt(const complex& x);Parameterx − This parameter x which represent the complex number.Return ValueThis function returns the square root of the complex number.Input  − Sqrt(3,8i)Output − (2.4024,1.6649)Input Sqrt(7,1i)Output − (2.6524,0.1885)Example#include #include Using namespace std; int main( ){    / / Defining of complex Number    Complex x(4,9);    Cout

We are given with an array of integers. The array has multiple occurrences of the same elements. The task here is to find the maximum distance between any two same elements of the array. We will pick each element from the array starting from the left. Then we will find the last occurrence of that same number and store the difference between indexes. Now if this difference is maximum then return it.Input Arr[] = { 1, 2, 4, 1, 3, 4, 2, 5, 6, 5 }Output −Maximum distance between two occurrences of same element in array − 4Explanation − The repeating ... Read More

We are given a string of alphabets. The array can have at least two occurrences of the same character. The task here is to find the maximum number of characters between any two occurrences of a character. If there is no repetition of any character then return -1.Input − string str = “abcdba”Output −Maximum number of characters between any two same character in a string − 4Explanation − The repeating characters are ‘a’ and ‘b’ only with indexes −1. 2‘a’ first index 0 last 5 , characters in between 5-0-1=4 2. ‘b’ first index 1 last 4 , characters in ... Read More

We are given a number of chocolates present in consecutive boxes in the form of an array and a number k which represents the number of students among which these chocolates will be distributed. The task here is to choose consecutive boxes such that the sum of chocolates present in them can be equally distributed among k students. Also we have to make sure that the number of chocolates is maximum.For this we will traverse the array from left to right and start adding the number of chocolates and divide the sum by k. If it is fully divided with ... Read More

We are given two lockers, say L1 and L2 that have some amount of money in the form of coins. L1 has A coins and L2 has B number of coins in it. We have to withdraw money or coins from the lockers such that the money drawn out is maximum. Each time the coins are drawn from any locker, it is replaced by coins 1 less than its previous count. If we draw A coins from L1 then it will be replaced by A-1 coins and if we draw B coins from L2 then it will be replaced by ... Read More

We are given with an array of integers of size N and a number k. The array consists of integers in random order. The task is to find the maximum difference between the group of k-elements and rest of the array. The array will be divided into two parts. The first part is a group of k-elements taken out and the second part is the rest of the elements of the array. We have to select k elements such that the difference between the sum of elements in both groups is maximum.If k is smaller ( half of array size) ... Read More

We are given with an array of integers of size N. The array consists of integers in random order. The task is to find the maximum difference between the first and last indexes of an element in the array. We have to find a number which appears twice in the array and the difference between its indexes is maximum. If there are more such pairs then we will store the maximum such difference between the indexes.Input Arr[] = { 2, 1, 3, 1, 3, 2, 5, 5 }.Output −Maximum difference between first and last indexes of an element in array − ... Read More

We are given with an array of integers of size N. The array consists of integers in random order. The task is to find the maximum difference between two elements such that the larger element appears after the smaller number. That is Arr[j]-Arr[i] is maximum such that j>i.Input Arr[] = { 2, 1, 3, 8, 3, 19, 21}.Output −The maximum difference between two elements such that the larger element appears after the smaller number − 20Explanation − The maximum difference is between 21 and 1 and 21 appears after 1 in the array.Input Arr[] = {18, 2, 8, 1, 2, 3, 2, ... Read More