This course was created with the
course builder. Create your online course today.
Start now
Create your course
with
Autoplay
Autocomplete
Previous Lesson
Complete and Continue
Dynamic Programing (Basic to Advance) by Mr. Vimal Daga
Welcome to Dyanamic Programming Training
Day 1 - Basic Algorithms | Recursion Concept (119:52)
Day 2 - Dynamic programming | Recursion tree | Fibonacci Series (104:41)
Day 3 - DP Memorization | Divide | Conquer approach (81:40)
Day 4 - Number factor problem (132:30)
Day 5 - Bottom Up Approach(Tabulation) | Comparision of Time | Space complexity of all the approaches (101:02)
Day 6 -Bottom-Up Approach | Fibonacci Series by Tabulation | Number Factor Problem By Tabulation (94:32)
Day 7 - 20/9/2022- dynamic programming | graph | Knapsack problem | for loop |DNC method |DP method |0/1 problem | greedy method | fractional Knapsack |Knapsack problem code (132:24)
Day 8 - 21/9/2022 -Knapsack problem code | fraction problem |0/1 problem | practical for 0/1 problem | greedy method |capacity of knapsack | DNC | recursion |brate- force method (107:18)
Day 9 - 23/09/2022 -Knapsack |greedy |0/1 | DNC | recursion |brate- force method | tabulation | solve 0/1 problem by using tabulation (100:37)
Drive Link
Google Drive link
Extra Videos
Graph Introduction (103:51)
Graph traversal (94:25)
BFS,DFS (104:13)
BFS,Single source shortest path problem (124:46)
Dijkstra Algorithm (140:56)
Heap,Common Graphs problem (111:27)
Bellman-ford algorithm (104:25)
Bellman-ford algorithm-2 (68:59)
Day 8 - 21/9/2022 -Knapsack problem code | fraction problem |0/1 problem | practical for 0/1 problem | greedy method |capacity of knapsack | DNC | recursion |brate- force method
Lesson content locked
If you're already enrolled,
you'll need to login
.
Enroll in Course to Unlock