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
C++ Articles
Page 26 of 597
C++ program to find n-th term of series 2, 10, 30, 68, 130 ...
In this problem, we are given an integer N. The task is to find the n-th term in series 2, 10, 30, 68, 130...Let’s take an example to understand the problem, InputN = 7Output350ExplanationThe series is 2, 10, 30, 68, 130, 222, 350...Solution ApproachA simple solution to the problem is by finding the general term of the series. Here, the Nth term of the series is N^3 + N. This is found by subtracting the current element with the current index.For i, i = 1, T(1) = 2 = 1 + 1 = 1^3 + 1 i = 2, T(1) ...
Read MoreFind maximum sum taking every Kth element in the array in C++
In this problem, we are given an array arr[] and an integer k. Our task is to Find the maximum sum taking every Kth element in the array.Problem description: We need to find the maximum sum of the elements of the array such that they are k indexes apart. i.e. we need to maximize the sum, sum = arr[i] + arr[i+k] + arr[i + 2*k] + …. arr[i + p*k], such that (i + p*k) < nLet’s take an example to understand the problem, Inputarr[] = {5, 3, −1, 2, 4, −5, 6}, k = 4Output9ExplanationAll sums of every kth ...
Read MoreC++ program to find n-th term of series 3, 9, 21, 41, 71...
In this problem, we are given an integer N. The task is to find the n-th term in series 3, 9, 21, 41, 71...Let’s take an example to understand the problem, InputN = 7Output169ExplanationThe series is 3, 9, 21, 41, 71, 169...Solution ApproachA simple solution to the problem is by finding the general term of the series. The general term can be found by observing the series a bit. It is, $$T(N) = \sum n^{2} + \sum n + 1$$We can directly use the formula for the sum of square of first n natural numbers, first n natural number and ...
Read MoreFind n-variables from n sum equations with one missing in C++
In this problem, we are given an array sum[] consisting of a sum of (n-1) variables given as, Sum[1] = x2 + x3 + x4 + … xn Sum[2] = x1 + x3 + x4 + … xn . . Sum[i] = x2 + x3 + x4 + … x(i-1) + x(i+1) + … + xn . . Sum[n] = x1 + x2 + x3 + … x(n-1) Our task is to find the value of x1, x2, ... xn.Let’s take an example to understand the problem, Inputsum[] = {6, 6, 6, 6, 6, 6, 6}Outputx1 = 1, x2 = ...
Read MoreFind N'th item in a set formed by sum of two arrays in C++
In this problem, we are given two sorted arrays arr1[] and arr2[] of size m and an element N. Our task is to Find Nth item in a set formed by the sum of two arrays.Code description − Here, we will create a set that consists of the sum of element one of arr1 and one of arr2 i.e. sum = arr1[i] + arr2[j], where are i , j < m. For N, we need to find the value of the Nth element of the set.Let’s take an example to understand the problem, Inputarr1[] = {3, 1, 5} , arr2[] = ...
Read MoreFind median in row wise sorted matrix in C++
In this problem, we are given a 2D array mat[r][c] whose elements are sorted row-wise. Our task is to Find median in a row-wise sorted matrix.Description − we need to find the median of elements of the matrix.Let’s take an example to understand the problem, Inputmat = { {2, 4, 7}, {5, 6, 8}, {4, 8, 9} }Output6ExplanationThe elements of the matrix stored in array are &minus{2, 4, 4, 5, 6, 7, 8, 8, 9} The median is 6.Solution ApproachA simple solution to the problem is by storing all elements of the array. Then finding the median ...
Read MoreFind n'th number in a number system with only 3 and 4 in C++
In this problem, we are given an element N. we need to find the N’th number in a number system with only 3 and 4.The number system consists of elements 3, 4, 33, 34, 43, 44, 333, 334, 343, 344, …Let’s take an example to understand the problem, InputN = 6Output44ExplanationThe numbers of the number system are − 3, 4, 33, 34, 43, 44...Solution ApproachThe number system is similar to the binary number system but the number 0 is replaced by 3 and number 1 is replaced by 4.Let’s say this as sBinary.So, number Nth number is (n-1)’s Sbinary conversion.With ...
Read MoreFind Minimum Depth of a Binary Tree in C++
In this problem, we are given a binary tree. Our task is to Find Minimum Depth of a Binary Tree.Binary Tree has a special condition that each node can have a maximum of two children.The minimum depth of a binary tree is the shortest path between the root node to any leaf node.Let’s take an example to understand the problem, InputOutput2Solution ApproachThe solution to the problem is by traversing the binary tree and counting the heights. This can be done by recursively calling for the child node of the node for each node non-leaf node and return 1 for each ...
Read MoreFind minimum number of merge operations to make an array palindrome in C++
In this problem, we are given an array arr[] consisting of n positive numbers. Our task is to Find minimum number of merge operations to make an array palindrome.Palindrome array are similar to palindrome strings, the elements at index i and n-i should be the same.Example{5, 1, 7, 2, 7, 1, 5}Problem Description − We need to make the array palindrome by performing operations on it. And the only operation which is valid on the array is the merge operation in which we will add elements at index i and i+1.We need to return the minimum number of such operations ...
Read MoreFind next greater number with same set of digits in C++
In this problem, we are given an element N. We need to find the next greater number with the same set of digits. We need to find the smallest number with the same digit which is greater than N.Let’s take an example to understand the problem, InputN = "92534"Output92543Solution ApproachA simple solution to the problem to find the next greater element is by the following approach −Traverse the number from least significant bit to most significant bit. And stop when the current element is smaller than the last element.After this search for the smallest element in the remaining array. And ...
Read More