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
Programming Articles
Page 1420 of 2547
Maximum possible XOR of every element in an array with another array in C++
In this problem, we are given two arrays A and B of n elements each. Our task is to create a program to find the maximum possible XOR of every element in an array with another array.We have to compute the maximum XOR for each element of array A with array B i.e. for each element of array A we will select an element in array B which will have the maximum XOR value.Let's take an example to understand the problem −Input −array A = {3, 6 ,11, 9} array B = {8, 2, 4, 1}Output −11 14 15 13Explanation−Let’s ...
Read MoreMinimum operations required to make all the array elements equal in C++
Problem statementGiven an array with n positive integers. We need to find the minimum number of operation to make all elements equal. We can perform addition, multiplication, subtraction or division with any element on an array element.ExampleIf input array is = {1, 2, 3, 4} then we require minimum 3 operations to make all elements equal. For example, we can make elements 4 by doing 3 additions.Algorithm1. Select element with maximum frequency. Let us call it ‘x’ 2. Now we have to perform n-x operations as there are x element with same valueExample#include using namespace std; int getMinOperations(int ...
Read MoreFind four factors of N with maximum product and sum equal to N in C++
Suppose we have an integer N. The task is to find all factors of N and display the product of four factors of N, such that −Sum of their four factors are equal to NThe product of four factors is maximumSuppose the number is 24, then the product is 1296. As we know all of the factors are 1, 2, 3, 4, 6, 8, 12, 24. We have to choose the factors 6 four times. So 6 + 6 + 6 + 6 = 24. Here the product is maximum.To solve this, we have to find all factors from 1 ...
Read MorePrint alternate nodes of a linked list using recursion in C++
A linked list is a linear data structure that stores the element in non-contiguous memory locations. Every element contains a pointer to the next element of the linked list.Example −In this problem, we are given a linked list and we need to print the elements of this linked list but only alternate elements are to be printed. Let’s take an example to understand the problem better, Input : 2 -> 4 -> 1 -> 67 -> 48 -> 90 Output : 2 -> 1 -> 48Explanation − We will print alternate elements on the linked list. So first, third and ...
Read MoreMaximum prefix-sum for a given range in C++
Problem statementGiven an array of n integers and q queries, each query having a range from l to r. Find the maximum prefix-sum for the range l – r.ExampleIf input array is arr[] = {-1, 2, 3, -5} and queries = 2 and ranges are: l = 0, r = 3 l = 1, r = 3 then output will be 4 and 5.The range (0, 3) in the 1st query has [-1, 2, 3, -5], since it is prefix, we have to start from -1. Hence, the max prefix sum will be -1 + 2 + 3 = 4The ...
Read MoreMinimum operations of given type to make all elements of a matrix equal in C++
Problem statementGiven an integer K and a matrix of M x N, the task is to find the minimum number of operations required to make all the elements of the matrix equal. In a single operation, K can be added to or subtracted from any element of the matrix.ExampleIf input matrix is: { {2, 4}, {20, 40} } and K = 2 then total 27 operations required as follows; Matrix[0][0] = 2 + (K * 9) = 20 = 9 operations Matrix[0][1] = 4 + (k * 8) = 20 = 8 operations Matrix[1][0] = 20 + (k ...
Read MorePrint all words matching a pattern in CamelCase Notation Dictionary in C++
In this problem, we are given an array of string in camelcase and a pattern. We have to print all those string of the array that match the given pattern.The array of string is an array in which elements are of the string data type.camelCase is a common method for naming in programming, in this way the first letter of the new word starts with an uppercase, rest all are lower case.Example − iLoveProgrammingProblem − find all strings that match a given pattern.Example −Input : “TutorialsPoint” , “ProgrammersPoint” , “ProgrammingLover” , “Tutorials”. Pattern : ‘P’ Output : “TutorialsPoint” , “ProgrammersPoint” ...
Read MoreMaximum Primes whose sum is equal to given N in C++
In this problem, we are given a number n. Our task is to find the maximum count of primes whose sum is equal to given N.Here, we will find the maximum number of prime numbers that when added will be equal to the number.The prime number are those number which can be divide by either themselves or one.let's take an example to understand the problem −Input − N = 9Output − 4Explanation −9 can be repressed as the sum of prime numbers in the following ways: 2, 2, 2, 3 3, 3, 3 2, 2, 5 2, 7 Out of ...
Read MoreStein's Algorithm for finding GCD in C++
Stein's Algorithm used for discovering GCD of numbers as it calculates the best regular divisor of two non-negative whole numbers. It replaces division with math movements, examinations, and subtraction. In the event that both an and b are 0, gcd is zero gcd(0, 0) = 0. The algorithm for GCD(a, b) as follows;AlgorithmSTART Step-1: check If both a and b are 0, gcd is zero gcd(0, 0) = 0. Step-2: then gcd(a, 0) = a and gcd(0, b) = b because everything divides 0. Step-3: check If a and b are both even, gcd(a, b) = 2*gcd(a/2, ...
Read MorePrint all possible strings of length k that can be formed from a set of n characters in C++
In this problem, we are given a set of characters and a positive integer k and we have to print all possible strings of length k that can be generated using the characters of the set.Let’s take an example to understand the problem better −Input: set = {‘x’, ‘y’, ‘z’} , k = 2 Output: xy, xz, yzTo solve this problem, we have to find all possible sequences that can be generated. For the set of size n, the total number of a possible string of length k will be nk (n^k). We will use a recursive call to generate ...
Read More