❗The content presented here is sourced directly from Youtube platform. For comprehensive course details, including enrollment information, simply click on the 'Go to class' link on our website.
Updated in [July 17th, 2023]
This course provides an introduction to the fundamentals of dynamic programming in Python. It covers the basics of dynamic programming, including the Bellman equation, the value iteration algorithm, and the policy iteration algorithm. It also covers the application of dynamic programming to solve problems in 1D, such as the knapsack problem, the rod cutting problem, and the longest common subsequence problem. The course includes hands-on exercises to help students gain a better understanding of the concepts. By the end of the course, students will have a solid understanding of dynamic programming and its application to 1D problems.