In this article, we will be discussing a program to find the sum of digits of a number until the sum itself becomes a single digit and cannot be done summation of further.For example, take the case of a number 14520. Adding the digits of this number we get 1 ... Read More

In this article, we will be discussing a program to find the minimum vertex cover size of a given graph using binary search.Minimum vertex cover is a set of vertices of the given graph such that every edge in the graph is incident of either of the vertices in that ... Read More

In this article, we will be discussing a program to find the first digit in the factorial of a given number.The basic approach for this is to find the factorial of the number and then get its first digit. But since factorials can end up being too large, we would ... Read More

In this article, we will be discussing a program to find the first collision point i.e the first point that both of the series have.In this, we would be given with five variables ‘a’, ‘b’, ‘c’, ‘d’ and ‘n’. We have to create two arithmetic progression series from these having ... Read More

In this article, we will be discussing a program to find the cabs near about (less than 50km) using the Great Circle Distance formula.Let us suppose we have been given a JSON file which contains the name and coordinates of the people who need a cab and also the coordinates ... Read More

In this article, we will be discussing a program to find an integer ‘k’, such that its modulus with each element of a given array is the same.For example, let us suppose we have been given with an array, arr = {12, 22, 32}Then we have the output value of ... Read More

In this article, we will be discussing a program to execute the Finite Automata algorithm for pattern searching.We are provided with a text[0...n-1] and a pattern[0...m-1]. We have to find all the occurrences of the pattern[] in the text[].For this we would preprocess the text[] and build a 2-d array ... Read More

In this article, we will be discussing a program to check if it is possible to finish all the given tasks on the basis of the given prerequisites.For example, let us say we have been given three tasks and prerequisites are [[1, 0], [2, 1], [3, 2]].( [1, 0] means ... Read More

In this article, we will be discussing a program to find ways an integer (say X) can be expressed as sum of n-th power of unique natural numbers.For example, let X = 100 and n = 2Then there would be 3 ways to express 100 as sum of squares of ... Read More

In this article, we will be discussing a program to find unique pairs of numbers having elements less than or equal to N and following some certain conditions −The square of difference between the two numbers must be equal to the LCM of those two numbers.The HCF of those two ... Read More