Ladder problem recursion

#1

when a person is standing on the grou d, then how it is one way?
if(n==0)
{
return 1;
}

I’d understood this base case

#2

hello @CODER_JATIN this is the possible count because the initital stage or your position is considered as valid .

#3

but we are not counting as n==0 as a position?

#4

we are counting that is why we are returning 1 there .
because n==0 is considered as a valid position .

#5

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.