HackerTube / Video

Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths

MIT OpenCourseWare

Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths

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

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

4 Hacker News mentions · 2016–2021

Topics

  • Algorithms & data structures
  • University lectures & courses

Watch on YouTube

Explore more videos