You are given an integer N representing the number of stairs. You can climb either 1 step or 2 steps at a time. Your task is to count the total number of different ways to reach exactly the Nth stair. Calculate and return the total number of possible ways.
Topics
Companies
Articles
Examples:
N/A
Constraints:
1 = N = 30
Companies:
Amazon
Topics:
Recursion
Please log in to access the Submissions tab, where you can review your progress and explore code submissions from other participants.
Please log in to access the Solution tab and view detailed answers and explanations.
Please log in to access the Discussion tab and join conversations with other participants.
Access Restricted: Please Login to access the code editor and test cases.