Redirecting to
NADOS

Climb Stairs With Minimum Moves

  Prev   Next

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

1. You are given a number n, representing the number of stairs in a staircase.
2. You are on the 0th step and are required to climb to the top.
3. You are given n numbers, where ith element's value represents - till how far from the step you 
     could jump to in a single move.  You can of-course fewer number of steps in the move.
4. You are required to print the number of minimum moves in which you can reach the top of 
     staircase.
Note -> If there is no path through the staircase print null.
Input Format 
A number n
.. n more elements
Output Format 
A number representing the number of ways to climb the stairs from 0 to top.
Question Video
Constraints 
0 <= n <= 20
0 <= n1, n2, .. <= 20
Sample Input 
10
3
3
0
2
1
2
4
2
0
0
Sample Output 
4


  • Asked in Companies
  • Related Topics






Video Solution

Code Solution

Run
 
Run
Id Name