GATE & ESE
Free courses
CS & IT
Algorithms
Lesson 1 of 5 • 18 upvotes • 2:49mins
This course will cover dynamic Programming solution for Matrix Chain Multiplication and Longest Common Subsequence.
5 lessons • 51m
Course Overview (in Hindi)
2:49mins
What is Dynamic Programming? (in Hindi)
12:34mins
DP Solution For Matrix Chain Multiplication (in Hindi)
12:22mins
DP Solution For Longest Common Subsequence (in Hindi)
12:26mins
Let's Revise (in Hindi)
10:53mins