Computer Science, asked by shubhangibhatt0707, 2 months ago

Problem Statement
Find the number ways in which Jimmy can reach the top of 'N' stairs.
1. He can jump from one step to the next consecutive step.
2. He can jump from one step to another step leaving a step in between.​​

Answers

Answered by saicharanb20072008
0

Answer:

1) 1 statement is correct

Explanation:

mark me as brainlist

Similar questions