Today we will solve "Climbing stairs" problem from #leetcode. This question has been asked by #amazon , #adobe , #bloomberg , #google , #apple , #facebook (#meta), #microsoft, #spotify , #uber and so many other companies.
we will discover 2 solutions to tackle this problem. One with O(n) space complexity and one with O(1) space complexity. both solutions will have O(n) Time complexity.
Don't miss Dynamic Programming playlist at here: https://www.youtube.com/watch?v=ctPljABdxnk&list=PLAtZcLSBX7j-06GpCKXa6XQ5GBXHlhXBZ
Please check the channel page for more #leetcode solution videos.
Also don't forget to like, comment, and subscribe. Hope you enjoy the video!
Chapters:
0:00 Pre-intro
0:25 Intro
0:35 Problem walk through
0:49 Examples
1:11 clarification of problem
5:47 Code walk through with space complexity of O(n)
8:09 Explaining O(1) space complexity solution
8:55 Coding O(1) space complexity
11:24 Time and Space Complexity
