Lecture 16: Dynamic Programming, Part 2: LCS, LIS, Coins
Data Science, Analytics & Computer TechnologyAlgorithms and Data StructuresComputer ScienceScience & MathMathematicsEngineering
Om kurset
This is the second of four lectures on dynamic programming. This introduces multiple sequence, substring subproblems, and parent pointers. Three examples of subproblem constraints and expansion are given. Instructor: Erik Demaine