Articles on Trending Technologies

Technical articles with clear explanations and examples

Find combined mean and variance of two series in C++

Arnab Chakraborty
Arnab Chakraborty
Updated on 11-Mar-2026 216 Views

ConceptWith respect of two given two different series arr1[b] and arr2[a] of size b and a. Our task is to determine the mean and variance of combined series.InputArr1[] = { 24, 46, 35, 79, 13, 77, 35 }; Arr2[] = { 66, 68, 35, 24, 46 };OutputMean1: 44.1429 Mean2: 47.8 StandardDeviation1: 548.694 StandardDeviation2: 294.56 Combined Mean: 45.6667 d1 square: 2.322 d2_square: 4.5511 Combined Variance: 446.056MethodNow suppose, n1= No. of observations in 'region 1'n2= No. of observations in 'region 1'X1= mean of region 1.X2=mean of region 2.S1=standard deviation of region 1.S2=standard deviation of region 2.S12 = variance of region 1.S22 = ...

Read More

Ways to read input from console in Java

AmitDiwan
AmitDiwan
Updated on 11-Mar-2026 5K+ Views

Let us see some ways to read input from console in Java −Exampleimport java.util.Scanner; public class Demo{    public static void main(String args[]){       Scanner my_scan = new Scanner(System.in);       String my_str = my_scan.nextLine();       System.out.println("The string is "+my_str);       int my_val = my_scan.nextInt();       System.out.println("The integer is "+my_val);       float my_float = my_scan.nextFloat();       System.out.println("The float value is "+my_float);    } }OutputThe string is Joe The integer is 56 The float value is 78.99A class named Demo contains the main function. An instance of the ...

Read More

Find d to maximize the number of zeros in array c[] created as c[i] = d*a[i] + b[i] in C++

Arnab Chakraborty
Arnab Chakraborty
Updated on 11-Mar-2026 261 Views

ConceptWith respect of two given arrays of M integers, assume an array C, where the i-th integer will be d*a[i] + b[i] where d is indicated as any arbitrary real number. Our task is to display or print d such that array C has largest number of zeros and also prints the number of zeros.Inputa[] = {15, 40, 45} b[] = {4, 5, 6}OutputValue of d is: -0.133333 The number of zeros in array C is: 1 If we choose d as -0.133333 then we get one zero in the array C which is the maximum possible.MethodsWe follow the below ...

Read More

Find Duplicates of array using bit array in C++

Arnab Chakraborty
Arnab Chakraborty
Updated on 11-Mar-2026 436 Views

ConceptWe have an array of n numbers, where n is maximum 32, 000. Now the given array may have duplicate entries and we do not know what n is. Now the question is arisen that with only4 Kilobytes of memory available, how would display or print all duplicates elements in the array?Inputarr[] = {2, 6, 2, 11, 13, 11}Output2 11 2 and 11 appear more than once in given array.Inputarr[] = {60, 50, 60}Output60MethodsNow we have 4 Kilobytes of memory which indicates we can address up to 8 * 4 * 210 bits.It should be noted that 32 * 210 ...

Read More

Count Magic squares in a grid in C++

Sunidhi Bansal
Sunidhi Bansal
Updated on 11-Mar-2026 453 Views

We are given with a matrix of numbers. The goal is to find the number of Magic squares present inside the given matrix.A Magic Square, if taken as a matrix, is a 3X3 matrix which contains the elements ranging from 1 to 9 just like a grid in Sudoku. Properties are −All numbers occur exactly once.Sum of all 9 cells in the matrix is 45.Sum of each row of 3 is 15.Sum of each column of 3 is 15.Sum of diagonals of 3 is 5.To get such sums, 5 is always in the middle of both diagonals.Inputint arr[][]= { { ...

Read More

Find element position in given monotonic Sequence in C++

Arnab Chakraborty
Arnab Chakraborty
Updated on 11-Mar-2026 351 Views

ConceptWith respect of a given integer l and a monotonic increasing sequence −f(m) = am + bm [log2(m)] + cm^3 where (a = 1, 2, 3, …), (b = 1, 2, 3, …), (c = 0, 1, 2, 3, …) Remember, here, [log2(m)] indicates, taking the log to the base 2 and round the value down.As a result of this, if m = 1, the value is 0.if m = 2-3, the value is 1.if m = 4-7, the value is 2.if m = 8-15, the value is 3.Our task is to determine the value m such that f(m) = ...

Read More

Find First element in AP which is multiple of given Prime in C++

Arnab Chakraborty
Arnab Chakraborty
Updated on 11-Mar-2026 153 Views

ConceptWith respect of given first term (A) and common difference (d) of an Arithmetic Progression, and a prime number (P), our task is to determine the position of the first element in the given AP which is treated as a multiple of the given prime number P.InputA = 3, d = 4, P = 5Output3ExplanationThe fourth term of the given AP is a multiple of prime number 5.First Term = 3Second Term = 3+4 = 7Third Term = 3+2*4 = 11Fourth Term = 3+3*4 = 15MethodAssume the term be AN. As a result of this, AN = (A + (N-1)*d)So, ...

Read More

Maximum in an array that can make another array sorted in C++

Sunidhi Bansal
Sunidhi Bansal
Updated on 11-Mar-2026 219 Views

We are given an array of numbers say Arr1[] and another array Arr2[] of same or different length. The Arr1[] has elements sorted in ascending order, such that a single element is unsorted. We must find the element from the second array Arr2[] such that it can replace the wrongly placed element of Arr1[] and make it sorted. Also, the element chosen from Arr2[] should be maximum if there are multiple options available.InputArr1[]= { 1,3,5,7,2,11 }, Arr2[]= { 4,8,7,10,9 }OutputMaximum element that can make Arr1 sorted: 10Explanation − Numbers in Arr2[] that can make Arr1[] sorted − 8,9,10 as they all are >=7 and =12 and

Read More

Maximum litres of water that can be bought with N Rupees in C++

Sunidhi Bansal
Sunidhi Bansal
Updated on 11-Mar-2026 718 Views

We are given N rupees. The goal is to buy maximum water possible with the money where the rates of water bottles are as follows −Plastic Bottles: A Rupees for 1 litreGlass Bottles: B Rupees for 1 litreGlass Bottles: B Rupees for 1 litreNow the original cost of glass bottles becomes B-E rupees. After returning.If the cost of plastic bottles is still less than B-E, then only buy plastic bottles. Else buy N-E/B-E glass bottles and spend rest on plastic bottles.InputN = 6, A = 5, B = 4, E = 3;OutputMaximum litres of water: 3Explanation − B-E=1, 1A n/a= ...

Read More

Maximum length of balanced string after swapping and removal of characters in C++

Sunidhi Bansal
Sunidhi Bansal
Updated on 11-Mar-2026 214 Views

We are given a string containing (, ), {, }, [, ] characters only. The goal is to find the maximum length of such string so that it becomes balanced by swapping adjacent characters or removing a character. We will do this by comparing adjacent characters, if they are opposite of each other then they can be swapped. ( }{, )(, ][ can be swapped, while {{, )), [[, }}, )), ]] cannot be swapped ).Also if a character has no matching pair, then it can be removed also. ( “{{}][“, here first { can be removed and balanced string ...

Read More
Showing 26991–27000 of 61,297 articles
Advertisements