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 2193 of 2547
Midy's theorem in C++
We are given integer values as a_num that will store the numerator and p_den that will store the denominator which should be a prime number. The task is to check whether the operations performed on a_num after dividing with p_den proves the midy’s theorem or not.Steps to prove Midy’s theorem are-Input numerator as a_num and denominator as p_den which should always be a prime value.Divide the numbers. Check for the repeating decimal values.Store the decimal values until they are not repeating.Check whether the digits are even, if yes, then break them into halvesAdd both the numbers. If the output is ...
Read MoreMaximum Subarray Sum in a given Range in C++
We are given with an array of integer elements of any given size. The task is to find the maximum sum which will be calculated by forming the subarrays from the given array within the given range which can be started from any possible index value in an array.Let us see various input output scenarios for this -In − int arr[] = { 3, 2, -1, 6, 7, 2 }, int first = 0, int last = 5Out − Maximum Subarray Sum in a given Range is: 19Explanation − we are given with an array containing both positive and negative values and a ...
Read MoreMinimize the sum of roots of a given polynomial in C++
We are given with an array of integer elements representing the coefficient values of a polynomial. The size of an array will be ‘n’ i.e. number of elements in an array. The degree of polynomial always starts with n-1 as there will be one constant value at the end of the polynomial series. The task is to replace the coefficient with other polynomials in such a manner that sum of roots will be minimized.Let us see various input output scenarios for this -In − int arr[] = { 2, -1, 4, 9, -1, 10, -5}Out − Minimize the sum of roots of ...
Read MoreN-th term in the series 1, 11, 55, 239, 991,...in C++
The given series is 1, 11, 55, 239, 991...If you clearly observe the series, you will find that the n-th number is 4n-2n-1.AlgorithmInitialise the number N.Use the series formula to compute the n-th term.Print the result.ImplementationFollowing is the implementation of the above algorithm in C++#include using namespace std; int getNthTerm(int n) { int num = pow(4, n) - pow(2, n) - 1; return num; } int main() { int n = 7; cout
Read MoreMinimum Word Break Problem in C++
We are given an array string of words of any given size and the task is to break the words in all possible ways such that after the break the string formed should be a valid string and we have to calculate all such minimum word break as per the problem.Let us see various input output scenarios for this -In − string word[] = {"Hello", "Hell", "tell", "well", "bell", "ball", "all" }Out − Minimum Word Break is: 1Explanation − we are given with multiple words. Now we will pass the concatenation of two strings i.e. Hell and all and will break the concatenated ...
Read Moren-th term in series 2, 12, 36, 80, 150....in C++
The given series is 2, 12, 36, 80, 150...If you clearly observe the series, you will find that the n-th number is n2 + n3.AlgorithmInitialise the number N.Use the series formula to compute the n-th term.Print the result.ImplementationFollowing is the implementation of the above algorithm in C++#include using namespace std; int getNthTerm(int n) { return (n * n) + (n * n * n); } int main() { int n = 7; cout
Read MoreMaximize the subarray sum after multiplying all elements of any subarray with X in C++
We are given with an integer array and an integer variable i.e. ‘X’. The task is to firstly form the subarray from the given array and then multiply all the elements of a subarray with an integer X. At last find out the elements that will contribute the maximum sum.Let us see various input output scenarios for this -In − int arr[] = {2, 4, 1, -5, -2}, X = 3Out − Maximize the subarray sum after multiplying all elements of any subarray with X are: 21Explanation − we are given with an array and an integer variable as X. Firstly, ...
Read MoreN-th root of a number in C++
You are given the N-th root and the result of it. You need to find the number such that numberN = result.Let's see some examples.Input result = 25 N = 2Output 5The 52 = 25. Hence the output in the above example is 5.Inputresult = 64 N = 3Output4 The 43 = 64. Hence the output in the above example is 4.AlgorithmImplementationFollowing is the implementation of the above algorithm in C++#include using namespace std; int getNthRoot(int result, int n) { int i = 1; while (true) { if (pow(i, n) == result) { return i; } i += 1; } } int main() { int result = 64, N = 6; cout
Read MoreMaximize the sum of array by multiplying prefix of array with -1 in C++
We are given an integer array and the task is to firstly fetch the prefix of an array and then multiply it with -1, secondly calculate the prefix sum of an array and lastly find the maximum sum from the prefix array generated.Prefix array is generated as −First element of prefixArray[0] = first element of an arraySecond element of prefixArray[1] = prefixArray[0] + arr[1]Third element of prefixArray[2] = prefixArray[1] + arr[2]Fourth element of prefixArray[3] = prefixArray[2] + arr[3] …..etc.Let us see various input output scenarios for this -In − int arr[] = {2, 4, 1, 5, 2}Out − Prefix array is: ...
Read MoreMinimum sum submatrix in a given 2D array in C++
We are given a 2-D array of integer elements forming the matrix. The task is to calculate the count of minimum sum by pulling the submatrix from the matrix so formed.Let us see various input output scenarios for this -In −int matrix[size][size] = { {2, 3, -1, 5}, {-2, 9, -1, 6}, { 5, 6, 9, -9}, { -6, 1, 1, 1} }Out −Minimum sum submatrix in a given 2D array is: -9Explanation −we are given a 2-D array of size 4x4 i.e. 4 rows and 4 columns. Now, we will find out the sub-matrix from the given matrix such ...
Read More