Course Link- Intro To Dynamic Programming – Coding Interview Preparation
Learn Dynamic programming to improve your Algorithms knowledge and prepare for the Software Engineering Coding Interview
What you’ll learn
- How to Solve a problem recursively
- How to come up with a dynamic programming solution
- How to code a dynamic programming solution
- How to solve frequent 1D and 2D dynamic programming problems
Course Requirements
- You should have a slight background on recurrences
- It is a plus if you are somewhat familiar with a modern programming language (C++/Java/Python).
Description By Instructors:
In this course, you will learn how to solve several problems using Dynamic Programming. We will discuss several 1 dimensional and 2-dimensional dynamic programming problems and show you how to derive the recurrence relation, write a recursive solution to it, then write a dynamic programming solution to the problem and code it up in a few minutes! We will cover problems such as:
- Climbing stairs
- Buying and Selling Stock
- 0/1 Knapsack
- Longest Common Substring
- Longest Common Subsequence
- Others!
By the end of this course, you should be fairly confident to tackle dynamic programming problems and to begin your journey in learning more Dynamic programming problems and solutions.
Who is the target audience?
- Anyone who wants to learn Dynamic programming to prepare for a job interview
- Anyone who wants to learn Dynamic programming to prepare for a Midterm/Final in an Algorithms Course
- Anyone who wants to learn Dynamic programming to get involved in Competitive Programming
- Anyone who wants to improve their Algorithms Skills
