Dynamic Programming
LCS, 0/1 knapsack, matrix chain, edit distance.
Log in to read this chapter
This chapter is part of GATE Computer Science. Log in to continue reading the full lessons, notes and practice.
What you'll learn in this chapter
DP Fundamentals and Principles
Longest Common Subsequence and Edit Distance
Knapsack and Subset Problems
Matrix Chain, Optimal BST and Interval DP