Video details loaded
HomeMIT 6.006 Introduction to Algorithms, Spring 2020Lecture 16: Dynamic Programming, Part 2: LCS, LIS, Coins

Lecture 16: Dynamic Programming, Part 2: LCS, LIS, Coins

58:44

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