Ladder problems recursion

#1

in this question. why we are not thinking like we go for 1 steps and then try the different jumps to reach to the top.
Instead we are doing from the top n-1 n-2 n-3 to reach to top. I didn’t get this…??

#2

@Vikaspal we think of it from backwards as it will be easy to solve then
like if k=2 we can come to n from n-1 and n-2 (we have to make a general code for n if you start thing from 1 then it will be difficult) .

#3

can u explain once again has prateek bhaiya is saying f(n-2) is already counted… at 4:28

#4

And also when we are on ground then how there is one ways ???

#5

@Vikaspal i think you have marked your doubt as resolved ( i cant see your doubt on my portal so i cant see the video) reopen the doubt or create a new one

#6

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.