❝HN 片单

Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths

MIT OpenCourseWare · 2 位 HN 用户推荐 · 2016–2021

  1. I really like the series of four lectures in the 2011 recording of the MIT Intro to Algorithms: [link] .
    — dovin, 2016
  2. I don't think I've ever been asked a DP problem in an interview, and only had to use it while programming once. That said, I liked the MIT lecture on it: [link]
    — dehrmann, 2021

← HN 片单