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 30 of 597
Find other two sides and angles of a right angle triangle in C++
In this problem, we are given an integer a denoting one side of a right angle triangle. We need to check whether it is possible to have a right angle triangle with side a. If it is possible, then find the other two sides and angle of a right angle triangle.Let’s take an example to understand the problem, Inputa = 5OutputSides : 5, 12, 13 Angles : 67.38, 22.62, 90ExplanationThe sides of right angle are found as 52 + 122 = 132 And using these sides we can find the angles are, Sin-1 (5/13) and 90 - Sin-1 (5/13).Solution ApproachA ...
Read MoreFind politeness of a number in C++
In this problem, we are given a positive integer N. Our task is to find the politeness of a number.Polite Number is a number which can be expressed as a sum of two or more consecutive numbers.Politeness of a number is defined as the number of ways the number can be expressed as sum of consecutive integers.Let’s take an example to understand the problem, Inputn = 5Output1Explanation2 + 3 = 5, is the only consecutive sum.Solution ApproachA simple solution to the problem is to check all consecutive numbers till N and if their sum is equal to N, increase count ...
Read MoreFind pairs in array whose sums already exist in array in C++
In this problem, we are given an array arr[] consisting of N integer. Our task is to find pairs in an array whose sums already exist in the array. We need to find pairs with sum value = a value in the arrayLet’s take an example to understand the problem, Inputarr[] = {1, 2, 4, 6, 7}Output(1, 6), (2, 4)ExplanationFor pairs (1, 6), the sum of values is 7 which is present in the array.For pairs (2, 4), the sum of values is 6 which is present in the array.Solution ApproachA simple solution to the problem is by finding all ...
Read MoreFind position of an element in a sorted array of infinite numbers in C++
In this problem we are given an array consisting of infinite sorted numbers. Our task is to Find position of an element in a sorted array of infinite numbers.Let’s take an example to understand the problem, Inputarr[] = {2, 4, 6, 8, 9, 12, 14, 17, ….}, ele = 9Output4ExplanationSolution ApproachFor searching elements from a sorted array efficiently, we will be using the binary searching method. Here, single the end point is not known, we will modify the algorithm a bit.We will fix the start pointer to first position, then take the end pointer to second position. After this, we ...
Read MoreFind pairs with given sum in doubly linked list in C++
In this problem, we are given a doubly linked list and a value sum. Our task is to find pairs with a given sum in a doubly linked list.Let’s take an example to understand the problem, Inputhead − 2 5 6 9 12 x = 11Output(2, 9), (5, 6)ExplanationFor pairs (2, 9), the sum of values is 11 For pairs (5, 6), the sum of values is 11Solution ApproachA simple solution to the problem is traversing the whole linked-list and taking elements one by one and finding the element in the remaining linked list whose sum ...
Read MoreFind Perimeter of a triangle in C++
In this problem, we will see the perimeter of a triangle, formula for the perimeter of different types of triangle and program to find them.Perimeter is defined as the total distance about the figure. Basically, it is the sum of all sides of the given figure.Perimeter of a triangleThe perimeter of a triangle is the sum of all its three sides (triangle is a three sides figure).Formula, Perimeter = sum of all sidesPerimeter = x + y + zProgram to find the perimeter of a triangle, Example#include using namespace std; int calcPerimeter(int x, int y, int z ){ ...
Read MoreFind position of the given number among the numbers made of 4 and 7 in C++
In this problem we are given a number N. Our task is to Find position of the given number among the numbers made of 4 and 7. The series consisting of 4 and 7 only is 4, 7, 44, 47, 74, 77, 444….Let’s take an example to understand the problem, InputN = 5Output74ExplanationSeries upto 5 terms is 4, 7, 44, 47, 74…Solution ApproachA simple solution to the problem is based on finding the pattern in the series.Here, every even position contains 7 in the end.And every odd position contains 4 in the end.So, we can find the series by going ...
Read MoreFind position of the only set bit in C++
In this problem we are given a number N which has only one set bit in its binary representation. Our task is to find the position of the only set bit. If the number has only one set bit return the position of the number otherwise print invalid number.Let’s take an example to understand the problem, InputN = 32Output6ExplanationBinary representation of the number is 10000.Solution ApproachOne fact to know before we proceed further is the number will have only 1 set bit if it is a power of 2. Otherwise it will have more number of set bits.A simple solution ...
Read MoreFind postorder traversal of BST from preorder traversal in C++
In this problem we are given an array preOrder[] that represents the preorder traversal of the binary search tree. Our task is to Find postorder traversal of BST from preorder traversal.Let’s take an example to understand the problem, InputpreOrder[] = {5, 2, 4, 7, 12}Output{4, 2, 12, 7, 5}Solution ApproachA simple solution to the problem is to create a BST from the given preorder traversal. And then do postorder traversal of the tree. This solution is Ok but a more effective solution is, We will traverse the preorder array with a limit on values to separate values of left and ...
Read MoreFind power of power under mod of a prime in C++
In this problem we are given four values A, B, C, M(a prime number). Our task is to Find power of power under mod of a prime.We simply need to find the value of (A ^ (B ^ C)) (mod M).Let’s take an example to understand the problem, InputA = 3, B = 6, C = 2, M = 11Output3Explanation(A ^ (B ^ C)) = (3 ^ (6 ^ 2)) = (3 ^ (36))(mod 11) = 3Solution ApproachA simple solution to the problem is by directly calculating the values of the (A ^ (B ^ C)) , which is done ...
Read More