Climbing Stairs (LeetCode 70) | Full solution with animations | Dynamic Easy | Study Algorithms

Given a staircase with n steps, we need to find the total number of distinct ways to climb it by taking 1 or 2 steps at a time. Sure, this can be done by a brute force method and finding all the possibilities, but there is a really easy way to understand this. This video shows how you can form building blocks and ultimately arrive at a very efficient solution. To make things easy, there is also a dry run of code in JAVA. Chapters: 00:00 - Intro 01:36 - Problem statement and description 04:51 - Brute Force Method 07:28 - How to understand and attack 09:41 - Finding an efficient solution 12:19 - Dry-run of Code 14:45 - Final Thoughts Actual problem on LeetCode: https://leetcode.com/problems/climbing-stairs/ ? Links to topics I talk about in the video: Dynamic Programming: https://youtu.be/tHqTq-H5utI Brute Force Solution: https://youtu.be/kdTpUjd71G8 What is Big O?: https://youtu.be/-MJ7EIV57dI ? A text based explanation is available at: https://studyalgorithms.com Code on Github: https://github.com/nikoo28/java-solutions/blob/master/src/main/java/leetcode/easy/ClimbingStairs.java Test-cases on Github: https://github.com/nikoo28/java-solutions/blob/master/src/test/java/leetcode/easy/ClimbingStairsTest.java ? Reference Books: Starting Learn to Code: https://amzn.to/36pU0JO Favorite book to understand algorithms: https://amzn.to/39w3YLS Favorite book for data structures: https://amzn.to/3oAVBTk Get started for interview preparation: https://amzn.to/39ysbkJ ? To see more videos like this, you can show your support on: https://www.buymeacoffee.com/studyalgorithms ? My Recording Gear: Recording Light: https://amzn.to/3pAqh8O Microphone: https://amzn.to/2MCX7qU Recording Camera: https://amzn.to/3alg9Ky Tablet to sketch and draw: https://amzn.to/3pM6Bi4 Surface Pen: https://amzn.to/3pv6tTs Laptop to edit videos: https://amzn.to/2LYpMqn ? Get Social ? Follow on Facebook at: https://www.facebook.com/studyalgos Follow on Twitter at: https://www.twitter.com/studyalgorithms Follow on Tumblr at: https://studyalgos.tumblr.com/ Subscribe to RSS feeds: https://studyalgorithms.com/feed/ Join fan mail: http://eepurl.com/g9Dadv #leetcode #programming #interview

Видео Climbing Stairs (LeetCode 70) | Full solution with animations | Dynamic Easy | Study Algorithms автора Модные DIY аксессуары