Skip to content
hackertubeai

MIT OpenCourseWare

Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths

About this video

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

Keep your curiosity going.

A few more ideas from the same corner of the archive.

Vectors | Chapter 1, Essence of linear algebra

3Blue1Brown

Ruby Conf 12 - Y Not- Adventures in Functional Programming by Jim Weirich

Confreaks

But what is the Fourier Transform? A visual introduction.

3Blue1Brown

But what is a neural network? | Deep learning chapter 1

3Blue1Brown