Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths
MIT OpenCourseWare · 4 HN recommendations
Video Q&A
Ask AI to explain this scene or summarize the whole video. When an answer includes timestamps, select one to jump to that moment.
Try asking: What is the speaker explaining here?
Google sign-in is required. Review the maximum credit cost before confirming.
Erik Demaine's MIT 6.006 lecture introducing dynamic programming through Fibonacci numbers and shortest paths. It covers memoization, subproblems and optimal substructure.
Why HN recommends it: Recommended as a clear introduction to dynamic programming from a well-regarded instructor.
“Please watch this MIT intro” Read on HN ↗