16. Dynamic Programming, Part 2: LCS, LIS, Coins
81,805 views
Why it's on BrighterTube
Hand-picked by a BrighterTube curator · found via Developer-Y/cs-video-courses · 92% confidenceTeaches dynamic programming on subsequences: longest common subsequence, longest increasing subsequence and coin games. Taught by Erik Demaine, Jason Ku and Justin Solomon from MIT's current 6.006 syllabus, with board work that is easy to follow on video.
What you'll learn
MIT 6.006, lecture 16: Dynamic programming on subsequences: longest common subsequence, longest increasing subsequence and coin games.
Video by MIT OpenCourseWare, played through YouTube's embedded player.
Part of MIT 6.006 Introduction to Algorithms, Spring 2020
Go deeper
- Introduction to Algorithms (CLRS), Cormen et al.The standard reference
- The Algorithm Design Manual, Steven SkienaPractical and readable
As an Amazon Associate, BrighterTube earns from qualifying purchases. Picked by hand for this subject; nobody paid to be listed.