filmov
tv
Climbing Stairs Dynamic Programming || LeetCode 70 || Amazon Coding Interview Question
Показать описание
How to approach climbing stairs dynamic programming problem?
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
++++++++++++++++++++++++++++++++++++++++++++++++++
++++++++++++++++++++++++++++++++++++++++++++++++++
#LeetCode #CodingInterview #LeetCodeProblem #LeetCodeSolution
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
++++++++++++++++++++++++++++++++++++++++++++++++++
++++++++++++++++++++++++++++++++++++++++++++++++++
#LeetCode #CodingInterview #LeetCodeProblem #LeetCodeSolution
0:18:08
0:19:31
0:09:20
0:00:55
0:00:55
0:04:10
0:03:03
0:10:54
0:00:40
0:13:17
0:01:00
0:16:35
0:05:12
0:10:55
0:09:31
0:08:26
0:06:09
0:19:27
0:07:18
0:14:15
0:03:59
0:05:27
0:05:56
0:06:14