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
Articles by Prateek Jangid
Page 16 of 17
Find the Number of Sink Nodes in a Graph using C++
In this article, we will describe the important information on solving the number of sinks nodes in a graph. We have a Directed Acyclic Graph with N nodes (1 to N) and M edges in this problem. The goal is to find how many sink nodes are there in the given graph. A sink node is a node that does not produce any outgoing edges. So here is a simple example −Input : n = 4, m = 2 Edges[] = {{2, 3}, {4, 3}} Output : 2Simple Approach to Find the SolutionIn this approach, we will go through ...
Read MoreFind the Number of Siblings of a Given Node in N-ary Tree using C++
In this article, we will provide complete information to determine the number of siblings of a given node in the n-ary tree. We need to find the node's siblings with the value of key as given by the user; if it is non, then output as -1. There is only one approach that we can use −Simple ApproachIn this approach, we will go through all the nodes and check if a child has the same value as the user. If it exists, we answer a number of children - 1(the given value).Example #include using namespace std; class Node { ...
Read MoreFind the Number of segments where all elements are greater than X using C++
In this article, we have to find the number of segments or subarrays in a given sequence where elements greater than the given number X.We can count overlapping segments only once, and two contiguous elements or segments should not count separately. So here is the basic example of the given problem −Input : arr[ ] = { 9, 6, 7, 11, 5, 7, 8, 10, 3}, X = 7 Output : 3 Explanation : { 9 }, { 11 } and { 8, 10 } are the segments greater than 7 Input : arr[ ] = { 9, 6, ...
Read MoreFind the Number of Reflexive Relations on a Set using C++
In this article, we will explain the approaches to find the number of reflexive relations on a set. In this problem, we are given with number n, and on a set of n natural numbers, we must determine the number of reflexive relations.Reflexive Relation − A relation in a set A is called reflexive if ( a, a ) belongs to R for every 'a' belongs to set A. For example −Input : x = 1 Output : 1 Explanation : set = { 1 }, reflexive relations on A * A : { { 1 } } Input ...
Read MoreFind the Number of quadruples where the first three terms are in AP and last three terms are in GP using C++
In this article, we will describe every possible approach to find the number of quadruples in which the first 3 terms are in A.P., and the last 3 are in G.P. First, we will explain the basic definition of arithmetic progression(A.P.) and geometric progression (G.P.).Arithmetic progression(A.P.) − It is a sequence of numbers in which the common difference (d) is the same or constant that means a difference of two consecutive numbers is constant. For example: 1, 3, 5, 7, 9 | d = 2Geometric Progression(G.P.) − It is a sequence of numbers in which the common ratios (r) are ...
Read MoreFind the Number of Quadrilaterals Possible from the Given Points using C++
A quadrilateral forms a polygon with four vertices and four edges in Euclidean plane geometry. The name 4-gon etc. Included in other names of quadrilaterals and sometimes they are also known as a square, display style, etc.In this article, we will explain the approaches to finding the number of quadrilaterals possible from the given points. In this problem, we need to find out how many possible quadrilaterals are possible to create with the provided four points ( x, y ) in the cartesian plane. So here is the example for the given problem −Input : A( -2, 8 ), B( ...
Read MoreFind the Number of Primes In A Subarray using C++
In this article we will describe the ways to find the number of primes in a subarray. We have an array of positive numbers arr[] and q queries having two integers that denote our range {l, R} we need to find the number of primes in the given range. So below is an example of the given problem −Input : arr[] = {1, 2, 3, 4, 5, 6}, q = 1, L = 0, R = 3 Output : 2 In the given range the primes are {2, 3}. Input : arr[] = {2, 3, 5, 8 ...
Read MoreFind the Number of Prime Pairs in an Array using C++
In this article, we will explain everything about finding the number of prime pairs in an array using C++. We have an array arr[] of integers, and we need to find all the possible prime pairs present in it. So here is the example for the problem −Input : arr[ ] = { 1, 2, 3, 5, 7, 9 } Output : 6 From the given array, prime pairs are (2, 3), (2, 5), (2, 7), (3, 5), (3, 7), (5, 7) Input : arr[] = {1, 4, 5, 9, 11} Output : 1Approaches to Find ...
Read MoreFind the Number of Prefix Sum Prime in Given Range Query using C++
In this article, we need to find a number of prefix sum which are prime numbers in a given array arr[ ] of positive integers and range query L, R, where L is the initial index value arr[ L ] for prefixsum[ ] array and R is the number of prefix sum we need to find.To fill the prefix sum array, we start with index L to index R and add the present value with the last element in the given array. So here is the Example for the problem −Input : arr[ ] = { 3, 5, 6, 2, ...
Read MoreFind the Number of Possible Pairs of Hypotenuse and Area to Form Right Angled Triangle using C++
In this article, we will explain how to solve the number of possible pairs of hypotenuse and area form a right-angled triangle in C++.We need to determine the number of all possible pairs of a hypotenuse and the area ( H, A ) to form a right-angled triangle with H as hypotenuse and A as Area.In this example − x = Base of Right Angled Triangle y = Height of Right Angled Triangle H = hypotenuse of Right Angled TriangleWe know Area of right angled triangle, A = ( x * ...
Read More