❗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]

This course, "Dynamic Programming Algorithms", is designed to help students gain a comprehensive understanding of critical Dynamic Programming concepts. It covers a variety of dynamic programming problems, such as Fibonacci number, Climbing Stairs, House Robber, Decode Ways, Longest Common Subsequence, 0/1 Knapsack Problem, Target sum, Partion Equal Subset Sum, Count Number of Subsets, Coin Change, Coin Change ii, Word Break, and Regular Expression Matching. Through detailed explanations, code implementations, and step-by-step walkthroughs, students will gain a deep understanding of each problem's solution. This course is perfect for those who are struggling with dynamic programming problems despite their understanding of data structures and algorithms. With a 30 day money back guarantee, enrol now and see you inside!

Course Syllabus

Introduction

1- Fibonacci Number

2- Climbing Stairs

3- House Robber

4- Decode Ways

5- Longest Common Subsequence

6- 0/1 Knapsack Problem

7- Partition Equal Subset Sum

8- Longest Increasing Subsequence

9- Count Number of Subsets

10- Coin Change

11- Coin Change II

12- Word Break

13- Target Sum

14- Edit Distance

15- Regular Expression Matching

16- Range Sum Query 2D - Immutable