hackertube.io

Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths

MIT OpenCourseWare · lecture · Watch on YouTube

Algorithms & data structuresUniversity lectures & courses

What it is

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

Why Hacker News recommends it

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

  • 4 people recommended it
  • 4 different months
  • 0 strong recommendations
  • first 2016, last 2021

What HN commenters said

  1. “See for some cool explanations.”

    Cool explanations of dynamic programming

    philippeback, 2016-08 · Recommendation · in “The Imposter's Handbook”

  2. “You may also like a couple of lectures by Erik Demaine”

    Erik Demaine's MIT lecture on dynamic programming

    gbacon, 2019-04 · Recommendation · in “Graphical Introduction to Dynamic Programming”

  3. “I liked the MIT lecture on it”

    Liked MIT lecture on dynamic programming

    dehrmann, 2021-02 · Recommendation · in “Algorithms by Jeff Erickson”

  4. “Please watch this MIT intro”

    Intro to dynamic programming, correcting misconceptions

    dominotw, 2021-04 · Recommendation · in “Dynamic Programming vs. Divide-and-Conquer (2018)”

Excerpts from Hacker News comments, linked to the originals. Summaries and labels were written by a language model from those comments.

Topics: algorithms, memoization, shortest paths, mit ocw, erik demaine

Also recommended by the same people