Climbing Stairs | Day 31 | [ July LeetCoding Challenge ] [ Leetcode - 70 ] [ 2020 ]
The day 31 problem in July Leetcoding Challenge. ( Climbing Stairs ).
Wikipedia Page: https://en.wikipedia.org/wiki/Fibonac...
Check out our other popular playlists:
✅✅✅[ Cracking the Coding Interview - Unique String ] : • Cracking the Coding Interview - Unique String
✅✅✅[ June Leetcoding Challenges ] : • June LeetCoding Challenge 2020
✅✅✅[ May Leetcoding challenges ]: • May LeetCoding Challenge 2020
Problem Link: https://leetcode.com/problems/climbin...
Problem statement:
You are climbing a stair case. It takes n steps to reach to the top.
Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?
Example 1:
Input: 2
Output: 2
Explanation: There are two ways to climb to the top.
1. 1 step + 1 step
2. 2 steps
Example 2:
Input: 3
Output: 3
Explanation: There are three ways to climb to the top.
1. 1 step + 1 step + 1 step
2. 1 step + 2 steps
3. 2 steps + 1 step
If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful.
Code Link: https://github.com/Algorithms-Made-Ea...
#coding #interview #programminglife #programmingisfun #programmer #tech #software #codinglife #leetcode