Seed Programming

School of Seed Programming Logo

09. Dynamic Programming

Wishlist Share
Share Course
Page Link
Share On Social Media

About Course

This is the ninth short courseDynamic 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

What Will You Learn?

  • Smart recursion and memoization techniques
  • Dynamic programming principles and strategies
  • Solving the Rod Cutting Problem
  • Advanced dynamic programming approaches
  • Practical problem-solving with dynamic programming

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
No Review Yet
Open chat
Hello 👋
Can we help you?
Need more information about 09. Dynamic Programming