Summary
Full Transcript
This is the first video of Dynamic Programming, we are starting from basic to build the foundation and will slowly move to advance problems. 1: Climbing Stairs: https://leetcode.com/problems/climbing-stairs/description/ 2: Count Hops: https://www.geeksforgeeks.org/problems/count-number-of-hops-1587115620/1?page=1&difficulty%5B%5D=0&category%5B%5D=Dynamic%2520Programming&sortBy=submissions Buy Course link: https://rohittnegi.akamai.net.in/new-courses/4-web-development-block-chain Play store app of Coder Army: https://play.google.com/store/apps/details?id=com.rohit.negi Coupon Code: CODER ARMY Buy Course at 4 Thousand ( 6 hours) Coder Army Website: https://www.coderarmy.in/ 00:00 Introduction 00:52 Problem - Climbing Stairs 2:55 How to know the problem is using recursion or not ? 3:43 Solving by Method 1 and Top Down approach 21:40 Code Part - Climbing Stairs using Method 1 and Top down Approach 25:10 Understanding Bottom Up Approach 32:59 Code Part - Climbing Stairs Bottom Up Approach 37:26 Solving by Method 2 and Top Down approach- Climbing Stairs 53:43 Code Part - Climbing Stairs using Method 2 and Top down approach 56:52 How to convert into Bottom Up ? 1:03:13 Code Part - Climbing Problem Method 2 Bottom Up 1:07:56 Home Work and Advice !! No Prerequisite Required Course Start Date: 16 sep 2024 Class Timing: 9-10 pm (Mon to Fri) LIVE Instructor: Rohit Negi Doubt Support: Discord Group Recording: It will be available after the class #dsa #dynamicprogramming
