A binary string is a string that contains only two types of different characters zeroes and ones. We can replace a substring '11' of the given string with another string '0' and we have to find the number of different possible strings we can get from it. We are going to use dynamic programming to get the solution as other methods may take exponential time complexity. Sample Example Input string str = 11010 Output 2 Explanation We can replace the first two numbers with the zero and can get another string 0010 and the second string is the ... Read More

Permutations and Combinations refer to the arrangements of objects in mathematics. Permutation − In permutation, the order matters. Hence, the arrangement of the objects in a particular order is called a permutation. Permutations are of two types − Permutation with repetition Suppose we have to make a three-digit code. Some possible numbers are 123, 897, 557, 333, 000, and 001. So how many numbers can we make like this? Let us look at it this way− In the once place, we have ten options − 0-9 Similarly, at the tenth and the hundredth place also, we have ten options. 0-9. ... Read More

HCF or the Highest common factor of two or more numbers refers to the highest number which divides them. A rational number is the quotient p/q of two numbers such that q is not equal to 0. Problem Statement Given an array with fractional numbers, find the HCF of the numbers. Example 1 Input [{4, 5}, {10, 12}, {24, 16}, {22, 13}] Output {2, 3120} Explanation The fractional numbers given are: 4/5, 10/12, 24/16 and 22/13 2/3120 is the largest number that divides all of them. Example 2 Input [{18, 20}, {15, 12}, {27, 12}, {20, 6}] ... Read More

The concept of an amicable pair of numbers or a friendly pair of numbers seems interesting right? So what exactly are amicable pairs of numbers? Two numbers are said to be an amicable pair of numbers only if the sum of the first number's proper divisors equals the sum of the second number's proper divisors. Also just in case you had forgotten, The Pythagoreans were always known for associating numbers with characteristics like justice and friendship. Problem Statement Implement a program to check whether the given pair of numbers is an amicable pair or not. ... Read More

The aim of this article is to implement a program to print the Stern-Brocot sequence. What is the Stern-Brocot sequence? Stern-Brocot sequence, which is also known as Stern’s diatomic series, is a sequence of numbers generated as given below. 1, 1, 2, 1, 3, 2, 3, 1, 4, 3, 5, 2, 5, 3, ... Although one may find that the Stern-Brocot sequence quite resembles the Fibonacci sequence 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, ... The Stern-Brocot sequence differs from the Fibonacci sequence in the method the Fibonacci sequence is produced. In ... Read More

Prime numbers are those numbers that are greater than one and they simply have two factors: the number itself and factor 1. This indicates that no number apart from 1 as well as the number itself could be used to divide these numbers without leaving a residue. For instance, the first ten prime numbers are 2, 3, 5, 7, 11, 13, 17, 19, 23, and 29. If we take the number 2, the factors are 2 and 1. That is the number itself and the factor 1. Similarly, if we take 11, the factors are 11 and 1. That is ... Read More

In this article, our aim is to determine the Simple Moving Average of the given values in the array. Let us take a quick glance at what Simple Moving Average means. The average derived from the data over a certain amount of time (t) is known as the simple moving average. In a typical mean, the Simple Moving Average value changes as a result of changing data, but in this kind of mean, it also varies over time. After obtaining the mean for a given period t, some earlier data is then eliminated. We receive new mean once more ... Read More

In this article our aim is to determine the most steps one can take in a row, provided the heights of the adjacent buildings, to gain altitude as he moves in from roof of one to the roof of the adjacent building. That is building heights for each one after another are provided. You can proceed from one building's roof to the next one down the block. You must determine how many consecutive steps you could indeed take in a row while still gaining altitude with each one. Problem Statement Maximize consecutive steps one can put forward on ... Read More

The aim of this article here is to make the elements distinct in a sorted array by minimum increments. First, an array of integers that has been sorted is provided. By increasing the values and keeping the array sum as low as possible, we must make array elements discrete from one another. As the output, we must display the smallest amount as the sum that is achievable. Problem Statement Make elements distinct in a sorted array by minimum increments. Approach Given an integer array of sorted numbers. We first check whether the elements in the given ... Read More

In this article, our primary aim is to come up with a solution to implement a random-0-6-Generator using the given random-0-1-Generator. As we know, A random-0-1-Generator() function returns either 0 or 1 as the output. Similarly, a random-0-6-Generator, as the name suggests, gives any random numbers between 0 and 6 (including 0 and 6). Also, a main point to keep in mind is that the random-0-6-Generator should generate random numbers ranging between 1 to 6, with equal probability. That is the probability of obtaining any number should always be the same. Example For instance, the random ... Read More