sample question

Problem Statement : We are given n disks and a series of rods, we need to transfer all the disks to the final rod under the given constraints−✓ We can move only one disk at a time.✓ Only the uppermost disk from the rod can be moved.✓ Any bigger disk cannot be placed on the […]

Problem Statement : There’s a staircase with N steps, and you can climb 1 or 2 steps at a time. Given N, write a function that returns the number of unique ways you can climb the staircase. The order of the steps matters.For example, if N is 4, then there are 5 unique ways:1, 1,

Problem Statement : Identify the logic behind the series 6 28 66 120 190 276….. The numbers in the series should be used to create a Pyramid. The base of the Pyramid will be the widest and will start converging towards the top where there will only be one element. Each successive layer will have

Problem Statement : Identify the logic behind the series 6 28 66 120 190 276….. The numbers in the series should be used to create a Pyramid. The base of the Pyramid will be the widest and will start converging towards the top where there will only be one element. Each successive layer will have

Problem Statement : Find the minimum number of coins required to form any value between 1 to N, both inclusive. Cumulative value of coinsshould not exceed N. Coin denominations are 1 Rupee, 2Rupee and 5 Rupee.Let’s understand the problem using the following example.Consider the value of N is 13, then the minimum number of coins

Problem Statement : The problem solvers have found a new castle for coding and named it as Nik’s castle. These smart people were given a task to make the purchase of items at the castle easier by distributing various coins with different values. Rahul has come up with a solution that if we make coins

Problem Statement : A positive integer d is said to be a factor of another positiveinteger N if when N is divided by d, the remainder obtained is zero. For example, for number 12, there are 6 factors 1, 2, 3,4, 6, 12. Every positive integer k has at least two factors, 1 and the

Problem Statement : Some prime numbers can be expressed as a sum of otherconsecutive prime numbers. For example 5 = 2 + 3, 17 = 2 + 3 + 5 + 7, 41 = 2 + 3 + 5 + 7 + 11 + 13. Now the task is to findout how many prime numbers