Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths

2,901,943 views

About this video

Hand-picked by a BrighterTube curator · found via HackerTube (Karpathy's dataset of videos Hacker News recommends · 92% confidence

One of the most-watched DP lectures, from MIT's core algorithms course.

Erik Demaine's MIT 6.006 lecture introducing dynamic programming through Fibonacci and shortest paths: memoization, subproblems and guessing.

Video by MIT OpenCourseWare, played through YouTube's embedded player.

Part of MIT 6.006 Introduction to Algorithms, Fall 2011

Go deeper

As an Amazon Associate, BrighterTube earns from qualifying purchases. Picked by hand for this subject; nobody paid to be listed.