Intro To Dynamic Programming - Coding Interview Preparation
- 3.9
-
![]()
![]()
![]()
![]()
Brief Introduction
Learn Dynamic programming to improve your Algorithms knowledge and prepare for the Software Engineering Coding InterviewDescription
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:
1.Climbing stairs
2.Buying and Selling Stock
3.0/1 Knapsack
4.Longest Common Substring
5.Longest Common Subsequence
6.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.
Requirements
- Requirements
- You should have a slight background on recurrences
- It is a plus if you are some what familiar with a modern programming language (C++/Java/Python).
El Farouk Yasser
3.9 Raiting
Intro To Dynamic Programming - Coding Interview Preparation
- 3.9
-
![]()
![]()
![]()
![]()
![]()
Learn Dynamic programming to improve your Algorithms knowledge and prepare for the Software Engineering Coding Interview In this course, you will learn how to solve several problems using Dynamic Programming....
Data Structures and Algorithms In Java for Coding Interview
- 4.1
-
![]()
![]()
![]()
![]()
![]()
Data Structures and Algorithms in Java to crack Coding Interview Using Data Structures Algorithms Master Java Algorithms Closed Captioning for rest of the sections is in progress....
The Complete Data Structures and Algorithms Course in Python
- 4.5
-
![]()
![]()
![]()
![]()
![]()
Data Structures and Algorithms from Zero to Hero and Crack Top Companies 100+ Interview questions (Python Coding) After finishing this course, you will be able to:...
