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 1128 of 2109
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 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 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 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 right sibling of a binary tree with parent pointers in C++
In this problem we are given a binary tree and parent pointers. Our task is to Find right sibling of a binary tree with parent pointers.Let’s take an example to understand the problem, InputNode = 3Output7Solution ApproachA simple solution to the problem is finding the leaf node of the nearest ancestor (which is neither the current node nor the parest of the current node) which is at the same level as the current node. This is done by counting the levels while going up and then when coming down counting them down. And then finding the node.Program to illustrate the ...
Read MoreFind row number of a binary matrix having maximum number of 1s in C++
In this problem, we are given a binary matrix in which each row is sorted. Our task is to Find row number of a binary matrix having the maximum number of 1s.Let’s take an example to understand the problem, InputbinMat[][] = { 1, 1, 1, 1 0, 0, 0, 0 0, 0, 0, 1 0, 0, 1, 1 }Output1Solution ApproachA simple solution to the problem is to count the total number of 1’s in each row. And then return the row number with maximum 1 count.Program to illustrate the working of our solution, Example#include using ...
Read MoreFind shortest unique prefix for every word in a given list in C++
In this problem, we are given an array of words arr[]. Our task is to find the shortest unique prefix for every word in the given list.Let’s take an example to understand the problem, Inputarr[] = {“learn”, “programming”, “code”}Outputc leap lear pSolution ApproachA simple solution to the problem is by finding all the prefixes of the word. And then check if it is a prefix of any other word in the array. If it is not, print it.An efficient approach is to use the trie data structure. We will construct a trie and store all words. Then find the frequency ...
Read MoreFind size of the largest '+' formed by all ones in a binary matrix in C++
In this problem, we are given an NxN binary matrix bin[][]. Our task is to find the size of the largest ‘+’ formed by all ones in a binary matrix.Let’s take an example to understand the problem, Input0 1 1 1 1 1 0 1 0Output5Solution ApproachA simple solution to the problem is to find the largest ‘+’ for which we need to find the maximum number of 1’s in one direction for a point in the matrix which needs to be the same in all four directions for a given 1. For this, we will create one matrix for ...
Read More