
About Course
This is the ninth short course – Dynamic Programming – of the Master Series on the Analysis of Algorithms. In this course, you’ll dive into the powerful technique of dynamic programming, learning how to optimize recursive solutions using memoization and smart recursion strategies. Through various problems like the Rod Cutting Problem, you’ll explore multiple dynamic programming approaches, gaining the skills to solve complex optimization problems efficientl
Course Content
Dynamic Programming
-
Dive into Dynamic Programming I – Smart Recursion
58:00 -
Dynamic Programming II
01:11:00 -
Dynamic Programming III – Rod Cutting Problem
36:00 -
Dynamic Programming IV
56:00 -
Dynamic Programming V
01:47:00 -
Dynamic Programming VI
01:11:00
Student Ratings & Reviews
No Review Yet