Print Stair paths | Module : Recursion and Backtracking | In English | Python | Video_8

NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. Question Name:
Print Stair Paths
Question Link:

Question Statement:
1. You are given a number n representing number of stairs in a staircase.
2. You are standing at the bottom of staircase. You are allowed to climb 1 step, 2 steps or 3 steps in one move.
3. Complete the body of printStairPaths function - without changing signature - to print the list of all paths that can be used to climb the staircase up.

Topic: #Recursion #Subsequence #String

Used #DataStructure: #Recursion on the way-up #Recursion

#TimeComplexity: O(2^N)

#SpaceComplexity: O(1) (including Recursive Space- O(N))

--------------------------------------------------------------

Similar Questions:

1. Print Subsequence:
2. Print KPC:

--------------------------------------------------------------

More Youtube PlayList:

---------------------------------------------------------------

Pepcoding has taken the initiative to provide counselling and learning resources to all curious, skillful and dedicated Indian coders. This video is part of the series to impart industry-level web development and programming skills in the community.



We also provide professional courses with live classes and placement opportunities.

.

.

.

Happy Programming !!! Pep it up

----------------------------------------------------------------

#Recursion #PrintStairPaths #EularPath

=================================================================