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
Articles by Arnab Chakraborty
Page 212 of 377
Check if a number is Primorial Prime or not in C++
ConceptWith respect of given positive number n, the task is to verify if n is a primorial prime number or not. We have to print ‘YES’ if n is a primorial prime number otherwise print ‘NO.Primorial Prime − With respect of Mathematics, a Primorial prime is defined as a prime number of the form pN# + 1 or pN# – 1 , where pN# is the primorial of pN such that the product of first N prime numbers.Input − n = 7Output − YES7 is Primorial prime of the form pN + 1 for N=2, Primorial is 2*3 = 6 ...
Read MoreFill 8 numbers in grid with given conditions in C++
Suppose we want to place 1, 2, 3, 4, 5, 6, 7, 8, into the eight circles in the given figure, in this way that no number is adjacent to a number that is next to it in the sequence.So, if the input is like0-1-10-1-1-1-10-1-10then the output will beTo solve this, we will follow these steps −N := 3, M := 4NOTCONSIDERED := -1Define a function present_in_grid(), this will take grid[N][M], num, for initialize i := 0, when i < N, update (increase i by 1), do:for initialize j := 0, when j < M, update (increase j by 1), ...
Read MoreFind a non empty subset in an array of N integers such that sum of elements of subset is divisible by N in C++
Suppose we have an array of n numbers; we have to find a non-empty subset such that the sum of elements of the subset is divisible by n. So, we have to output any such subset with its size and the indices of elements in the original array when it is present.So, if the input is like [3, 2, 7, 1, 9], then the output will be [2], [1 2].To solve this, we will follow these steps −Define one map my_mapadd := 0for initialize i := 0, when i < N, update (increase i by 1), do −add := (add ...
Read MoreFind a number which give minimum sum when XOR with every number of array of integer in C++
ConceptWith respect of given array Arr[] of non-negative integers, the task is to determine an integer X such that (Arr[0] XOR X) + (Arr[1] XOR X) + … + Arr[n – 1] XOR X is minimum possible.Input Arr[] = {3, 4, 5, 6, 7}Output X = 7, Sum = 10ApproachSo we will verify ‘i’th bit of every number of array in binary representation and consider and count those numbers containing that ‘i’th bit set to ‘1’ because these set bits will contribute to maximize the sum instead of minimize. As a result of this, we have to build this set ‘i’th bit ...
Read MoreFind a pair with given sum in a Balanced BST in Java
ConceptWith respect of a given Balanced Binary Search Tree and a target sum, we write a function that returns true if there is a pair with sum equals to target sum, otherwise return false. In this case, expected time complexity is O(n) and only O(Logn) extra space can beimplemented. Here, any modification to Binary Search Tree is not permitted.We have to note that height of a Balanced BST is always O(Logn).ExampleMethodAccording to the Brute Force Solution, we consider each pair in BST and verify whether the sum equals to X. The time complexity of this solution will be O(n^2).Now a ...
Read MoreFind all reachable nodes from every node present in a given set in C++
Suppose we have one undirected graph and a set of vertices; we have to find all reachable nodes from every vertex present in the given set.So, if the input is likethen the output will be [1, 2, 3] and [4, 5] as these are two connected components.To solve this, we will follow these steps −nodes := number of nodes in the graphDefine an array visited of size: nodes+1. And fill with 0Define one map mcomp_sum := 0for initialize i := 0, when i < n, update (increase i by 1), do −u := arr[i]if visited[u] is false, then −(increase comp_sum ...
Read MoreFind alphabetical order such that words can be considered sorted in C++
Suppose we have an array of words, we have to find any alphabetical order in the English alphabet so that the given words can be considered sorted in ascending order, if there is any such order exists, otherwise return "impossible".So, if the input is like words = ["efgh", "wxyz"], then the output will be zyxvutsrqponmlkjihgfewdcbaTo solve this, we will follow these steps −ALPHABET := 26n := size of vif n is same as 1, then −display "abcdefghijklmnopqrstuvwxyz"returnDefine an array adj of size ALPHABETDefine an array in of size ALPHABET and fill with 0pre := v[0]for initialize i := 1, when ...
Read MoreFind an integer X which is divisor of all except exactly one element in an array in C++
ConceptWith respect of a given array of integers, our task is to determine an integer B which isthe divisor of all except for exactly one element in the given array.It should be noted that the GCD of all the elements is not 1.Input arr[] = {8, 16, 4, 24}Output 8 8 is the divisor of all except 4.Input arr[] = {50, 15, 40, 41}Output 5 5 is the divisor of all except 41.MethodWe create a prefix array A such that position or index i contains the GCD of all the elements from 1 to i. In the similar way, create a suffix array C ...
Read MoreInorder Traversal of a Threaded Binary Tree in C++
Here we will see the threaded binary tree data structure. We know that the binary tree nodes may have at most two children. But if they have only one children, or no children, the link part in the linked list representation remains null. Using threaded binary tree representation, we can reuse that empty links by making some threads.If one node has some vacant left or right child area, that will be used as thread. There are two types of threaded binary tree. The single threaded tree or fully threaded binary tree.For fully threaded binary tree, each node has five fields. ...
Read MoreFind combined mean and variance of two series in C++
ConceptWith respect of two given two different series arr1[b] and arr2[a] of size b and a. Our task is to determine the mean and variance of combined series.InputArr1[] = { 24, 46, 35, 79, 13, 77, 35 }; Arr2[] = { 66, 68, 35, 24, 46 };OutputMean1: 44.1429 Mean2: 47.8 StandardDeviation1: 548.694 StandardDeviation2: 294.56 Combined Mean: 45.6667 d1 square: 2.322 d2_square: 4.5511 Combined Variance: 446.056MethodNow suppose, n1= No. of observations in 'region 1'n2= No. of observations in 'region 1'X1= mean of region 1.X2=mean of region 2.S1=standard deviation of region 1.S2=standard deviation of region 2.S12 = variance of region 1.S22 = ...
Read More