❗The content presented here is sourced directly from Udemy platform. For comprehensive course details, including enrollment information, simply click on the 'Go to class' link on our website.
Updated in [July 17th, 2023]
By taking this course, learners can gain experience and expertise in the field of dynamic programming. They will learn how to apply the top-down and bottom-up approaches to solve various problems, such as the 0-1 Knapsack Problem, Fibonacci Series, Longest Common Subsequence Problem, Frog's Staircase to Heaven, Grid Walking Problem, Stock Buy Sell Problem, The Coin Change Problem, and Range Sum Making Queries without updates. They will also gain a better understanding of the mathematical optimization method and computer programming method of dynamic programming. With this knowledge, learners will be able to apply dynamic programming to solve complex problems and optimize their solutions.
Course Syllabus
Introduction to Dynamic Programming
Fibonacci Series using Dynamic Programming
0/1 Knapsack Problem
Longest Common Subsequence
Frog's staircase to Heaven Problem
Grid Walking Problem
Stock Buy Sell Problem
The Coin Change Making Problem
Range sum making queries without updates
Download the source codes here!