Climbing Stairs (LeetCode 70) – Part 1
EasyLeetCode 70 · 1D · Google, Amazon +33 · 0:06Climbing Stairs · Recur + Memo · Bottom Up · DP Concepts & Qns - 3 · Leetcode-70My notes
Sign in to keep private notes on every station, with video timestamps.
Pause here and write your approach in two lines. Compare it with MIK's when the video ends.
Sign in to write your approach →About this video
Video solution (part 1 of 2) for LeetCode 70 Climbing Stairs by codestorywithMIK: Dynamic Programming, Easy. Topics: Math, Dynamic Programming, Memoization. Watch the explanation, then check the code and solve it on LeetCode.
- Problem
- LeetCode 70: Climbing Stairs
- Difficulty
- easy
- Topics
- Math, Dynamic Programming, Memoization
- Patterns
- 1D
- Chapter
- Dynamic Programming
- Duration
- 0:06
Related problems
- Fibonacci Number (LeetCode 509)
- House Robber (LeetCode 198)
- House Robber II (LeetCode 213)
- Build Array Where You Can Find The Maximum Exactly K Comparisons (LeetCode 1420)
- Minimum Insertion Steps to Make a String Palindrome (LeetCode 1312)
- Minimum Difficulty of a Job Schedule (LeetCode 1335)
- Maximum Length of a Concatenated String with Unique Characters (LeetCode 1239)
- Ugly Number II (LeetCode 264)