23 OCT 2025 - We are back! If you have been following us over the last few years, you will know that the last 2 months have been rough. We website was practically not loading. Sorry for the mess. We are back though and everything should run smoothly now. New servers. Updated domains. And new owners. We invite you all to start uploading torrents again!
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
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).
Description
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.
Source: PaidCoursesForFree.com
VISITOR COMMENTS (0 )
FILE LIST
Filename
Size
1. Dynamic Programming/1. What is Dynamic Programming.mp4
9.1 MB
1. Dynamic Programming/1. What is Dynamic Programming.vtt
4.4 KB
1. Dynamic Programming/10. BONUS LECTURE Problem 9 Maximum Sum of a Contiguous Sub array Problem.mp4
27.1 MB
1. Dynamic Programming/10. BONUS LECTURE Problem 9 Maximum Sum of a Contiguous Sub array Problem.vtt
13.5 KB
1. Dynamic Programming/11. CORRECTION LECTURE House Robber Problem With the Fixed Base Cases.mp4
27.8 MB
1. Dynamic Programming/11. CORRECTION LECTURE House Robber Problem With the Fixed Base Cases.vtt
13.6 KB
1. Dynamic Programming/2. Problem 1 Climbing Stairs.mp4
25.8 MB
1. Dynamic Programming/2. Problem 1 Climbing Stairs.vtt
12.4 KB
1. Dynamic Programming/3. Problem 2 Cutting Rods.mp4
41.8 MB
1. Dynamic Programming/3. Problem 2 Cutting Rods.vtt
18.5 KB
1. Dynamic Programming/4. Problem 3 House Robber.mp4
42.4 MB
1. Dynamic Programming/4. Problem 3 House Robber.vtt
19.5 KB
1. Dynamic Programming/5. Problem 4 Best Time To Buy And Sell Stock.mp4
36.5 MB
1. Dynamic Programming/5. Problem 4 Best Time To Buy And Sell Stock.vtt
17.6 KB
1. Dynamic Programming/6. Problem 5 Maximum Length of Pair Chain.mp4
30.9 MB
1. Dynamic Programming/6. Problem 5 Maximum Length of Pair Chain.vtt
30.9 MB
1. Dynamic Programming/7. Problem 6 01 Knapsack.mp4
28.4 MB
1. Dynamic Programming/7. Problem 6 01 Knapsack.vtt
12.6 KB
1. Dynamic Programming/8. Problem 7 Longest Common Sub-sequence.mp4
19 MB
1. Dynamic Programming/8. Problem 7 Longest Common Sub-sequence.vtt
7.6 KB
1. Dynamic Programming/9. Problem 8 Longest Common Sub-string.mp4
19.4 MB
1. Dynamic Programming/9. Problem 8 Longest Common Sub-string.vtt