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 1114 of 2109
Find number of unique triangles among given N triangles in C++
In this problem, we are given three arrays s1[] , s2[] and s3[] of size N, denoting N triangles. Our task is to find the number of unique triangles among given N triangles.For a triangle to be unique, all its side should be unique i.e. no other triangle should have the same sides.Let’s take an example to understand the problem, Inputs1[] = {1, 5, 3} s2[] = {2, 3, 2} s3[] = {4, 2, 5}Output1ExplanationTriangle with sides 1 2 4 is unique.Solution ApproachA simple solution to the problem is by counting the number of triangles which are unique.For this, we ...
Read MoreFind numbers with K odd divisors in a given range in C++
In this problem, we are given three integer values, L, R, and k. Our task is to find numbers with K odd divisors in a given range. We will be finding the count of numbers in the range [L, R] that have exactly k divisors.We will be counting the 1 and the number itself as a divisor.Let’s take an example to understand the problem, Inputa = 3, b = 10, k = 3Output2ExplanationNumbers with exactly 3 divisors within the range 3 to 10 are 4 : divisors = 1, 2, 4 9 : divisors = 1, 3, 9Solution ApproachA simple ...
Read MoreFind perimeter of shapes formed with 1s in binary matrix in C++
In this problem, we are given a binary matrix bin[][] of size nXm consisting of 0’s and 1’s only. Our task is to Find perimeter of shapes formed with 1s in a binary matrix.The perimeter taken will cover the figure from all sides, i.e.For 1 single value, the perimeter is 4.Let’s take an example to understand the problem, Inputbin[][] = [1, 0] [1, 0]Output6ExplanationThe cells (0, 0) and (1, 0) are connected making a rectangle of sides 2 and 1. The perimeter is 6.Solution ApproachA simple solution to the problem is simply finding all one and their ...
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 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 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 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 MoreFind probability that a player wins when probabilities of hitting the target are given in C++
In this problem we are given four values p, q, r, s. Our task is to Find probability that a player wins when probabilities of hitting the target are given.Here, we have two players who are playing a game of archery. And the probability of player 1 hitting the target is defined as p/q. The probability of player 2 hitting the target is defined as r/s. We need to find the probability of player one winning the game.Let’s take an example to understand the problem, Inputp = 3, q = 5, r = 2, s = 5Output0.789Solution Approach*This approach requires ...
Read MoreFind Pth term of a GP if Mth and Nth terms are given in C++
In this problem we are given five values m, n, mth term, nth term, p. Our task is to Find Pth term of a GP if Mth and Nth terms are given.For a GP, we are given the values of mth term and nth term. Using these values, we need to find the Pth term of the series.Let’s take an example to understand the problem, Inputm = 7, mthTerm = 1458, n = 10, nthterm = 39366, p = 3Output18Solution ApproachHere, we are given a GP. let's suppose the GP is, GP = a , a*r , a*(r2), a*(r3) ….The ...
Read MoreFind row with maximum sum in a Matrix in C++
In this problem, we are given a matrix mat[][] of size N*N. Our task is to Find the row with maximum sum in a Matrix.Let’s take an example to understand the problem, Inputmat[][] = { 8, 4, 1, 9 3, 5, 7, 9 2, 4, 6, 8 1, 2, 3, 4 }OutputRow 2, sum 24ExplanationRow 1: sum = 8+4+1+9 = 22 Row 2: sum = 3+5+7+9 = 24 Row 3: sum = 2+4+6+8 = 20 Row 4: sum = 1+2+3+4 = 10Solution ApproachA simple solution to the problem is to find the sum of elements of ...
Read More