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
Server Side Programming Articles
Page 1316 of 2109
Program to find sum of elements in a given array in C++
In this problem, we are given an array arr[] of n integer values. Our task is to create a Program to find sum of elements in a given array in C++.Program Description − For the given array, we will add up all elements and return the sum.Let’s take an example to understand the problemInputarr[] = {3, 1, 7, 2, 9, 10}Output32ExplanationSum = 3 + 1 + 7 + 2 + 9 + 10 = 32Solution ApproachTo find the sum of elements of the array, we will traverse the array and extract each element of the array and add them to ...
Read MoreProgram to find sum of first n natural numbers in C++
In this tutorial, we will be discussing a program to find sum of first n natural numbers.For this we will be provided with an integer n. Our task is to add up, find the sum of the first n natural numbers and print it out.Example#include using namespace std; //returning sum of first n natural numbers int findSum(int n) { int sum = 0; for (int x=1; x
Read MoreProgram to find sum of series 1 + 1/2 + 1/3 + 1/4 + .. + 1/n in C++
In this problem, we are given a number n. Our task is to create a program to find sum of series 1 + 1/2 + 1/3 + 1/4 + .. + 1/n in C++.Code description − Here, we will find the sum of the series 1 + 1/2 + 1/3 + 1/4 + .. + 1/n till nth term. The series is a harmonic progression series.Harmonic progression is a series whose inverse will be an arithmetic progression. I.e. if for a harmonic progression A1, A2, A3... An, there is an arithmetic progression 1/A1, 1/A2, 1/A3.First, let’s take an example to ...
Read MoreProgram to find the angles of a quadrilateral in C++
In this problem, we are given a value d, which is the common difference of AP. This AP is all the angles of a quadrilateral. Our task is to create a program to find the angles of a quadrilateral in C++.Problem Description − Here, the angles of the quadrilateral are in the form of an AP with common difference d. And we need to find the angles.Let’s take an example to understand the problemInputd = 15Output67.5, 82.5, 97.5, 112.5ExplanationFirst angle is x Second angle is x + 15 Third angle is x + 30 Four angle is x + 45Sum ...
Read MoreSplit Array Largest Sum in C++
Suppose we have an array of positive integers and one value m. We can divide this array into m number of contiguous subarrays. We have to devise an algorithm to minimize the largest sum among these m subarrays.So if the array is say [7, 2, 4, 10, 9], and m = 2, then the sum will be 19, as we can make two subarrays like [7, 2, 4] and [10, 9], then the subarray with largest sum is 19.To solve this, we will follow these steps −Define a function splitArray(), this will take an array v, m, n := size ...
Read MoreK-th Smallest in Lexicographical Order in C++
Suppose we have two values n and k. We have to find the lexicographically kth smallest integer in the range of 1 to n. So if the input is like n = 14 and k = 3, then the output will be 11, as the sequence will be [1, 10, 11, 12, 13, 14, 2, 3, 4, 5, 6, 7, 8, 9], then the kth number is 11.To solve this, we will follow these steps −Define a function findKthNumber(), this will take n, k,curr := 1(decrease k by 1)while k is non-zero, do −steps := call the function calcSteps(n, curr, curr + 1)if steps
Read MoreArithmetic Slices II - Subsequence in C++
Suppose we have an array A, where N numbers are present. A subsequence slice of that array is any sequence of integers like (K0, K1, K2, … Kn) such that 0 = 2. So we have to return the number of arithmetic slices.So if the input is like [2, 4, 6, 8, 10], then the answer will be 7, as there are 7 arithmetic slices. [2, 4, 6], [2, 4, 10], [4, 6, 8], [6, 8, 10], [2, 4, 6, 8], [4, 6, 8, 10], [2, 4, 6, 8, 10], To solve this, we will follow these steps −ret := ...
Read MorePoor Pigs in C++
Suppose there are 1000 buckets, one of them is poisonous, others are filled with water. They all look similar. If a pig drinks the poison it will die within 15 minutes. What will be the minimum amount of pigs that we need to find out the poisonous bucket within one hour?So now consider for the general case and devise an algorithm for this. So, the general case is that If there are n different buckets and a pig drinking poison will die within m minutes, how many pigs are needed to find poisonous bucket within p minutes? There is exactly ...
Read MoreLargest Palindrome Product in C++
Suppose we have input n, we have to find the largest palindrome that can be made using multiplication of two n digit numbers. As the numbers are very large, we can perform mod using 1337. So if the input is say 2, then the answer will be 987, 987 = (99*91) mod 1337 = 9009 mod 1337 = 987.To solve this, we will follow these steps −maxVal := 10^n – 1minVal := maxVal / 10for initialize h := maxVal, when h > minVal, update (decrease h by 1), do −left := h, right := 0for initialize i := h, when ...
Read MoreSuper Washing Machines in C++
Suppose we have n super washing machines on a row. Initially, each washing machine has some dresses or empty. Now, for each move, we can choose any m (1 ≤ m ≤ n) washing machines, and pass one dress of each washing machine to one of its adjacent washing machines at the same time. Suppose we have one integer array representing the number of dresses in each washing machine from left to right on the row, we should find the minimum number of moves to make all the washing machines have the same number of clothes. If it is not ...
Read More