Dynamic Programming I: Fibonacci and Shortest Paths

MIT OpenCourseWare · Lecture · YouTube title: Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths

Why it's here

Recommended as a clear introduction to dynamic programming from a well-regarded instructor.

What it covers

Erik Demaine's MIT 6.006 lecture introducing dynamic programming through Fibonacci numbers and shortest paths. It covers memoization, subproblems and optimal substructure.