Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths
MIT OpenCourseWare4 HN recommenders · recommended in 4 months, 2016-2021
2.9M views · 13 years ago · lecture · evergreen
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.
1:20:1117. Succinct Structures I
MIT OpenCourseWare
17K views • 12 years ago
1:12:56Lecture 1A: Overview and Introduction to Lisp
MIT OpenCourseWare
420K views • 7 years ago
1:12:56Lecture 1A | MIT 6.001 Structure and Interpretation, 1986
MIT OpenCourseWare
995K views • 17 years ago
58:22Lecture 1B | MIT 6.001 Structure and Interpretation, 1986
MIT OpenCourseWare
116K views • 17 years ago
1:00:341. Introduction, Finite Automata, Regular Expressions
MIT OpenCourseWare
626K views • 5 years ago
49:47Lecture 1 | Programming Methodology (Stanford)
Stanford
2.6M views • 18 years ago
39:49Lec 1 | MIT 18.06 Linear Algebra, Spring 2005
MIT OpenCourseWare
4.9M views • 17 years ago
17:26Lecture 1 | Programming Paradigms (Stanford)
Stanford
1.2M views • 18 years ago
53:30Lec 1 | MIT 6.00 Introduction to Computer Science and Programming, Fall 2008
MIT OpenCourseWare
6.6M views • 17 years ago
1:24:38Lecture 7A: Metacircular Evaluator, Part 1
MIT OpenCourseWare
32K views • 7 years ago
1:19:35Lecture 1: Introduction
MIT 6.824: Distributed Systems
921K views • 6 years ago
10:44P vs. NP and the Computational Complexity Zoo
hackerdashery
3.7M views • 12 years ago
42:31"Datafun: a functional query language" by Michael Arntzenius
Strange Loop Conference
9K views • 9 years ago
1:08:40Lecture 1 | Machine Learning (Stanford)
Stanford
2.7M views • 18 years ago
1:07:02Stanford Lecture: Don Knuth—"A Conjecture That Had To Be True" (2017)
Stanford Online
30K views • 8 years ago
1:21:28Lecture 01 - The Learning Problem
caltech
1.5M views • 14 years ago
44:09Lec 1 | MIT 6.042J Mathematics for Computer Science, Fall 2010
MIT OpenCourseWare
2.8M views • 13 years ago
53:22Ruby Conf 12 - Y Not- Adventures in Functional Programming by Jim Weirich
Confreaks
65K views • 13 years ago
46:46Category Theory 1.1: Motivation and Philosophy
Bartosz Milewski
394K views • 10 years ago
1:04:45Stanford Seminar - Concatenative Programming: From Ivory to Metal
Stanford Online
14K views • 8 years ago
4 comments from Hacker News
> on interviews they want you to explicitly construct the array very often i.e. it's the different between hire and a strong hire exactly because @lru_cache is much easier are you serious? someone really asked you to "use array". Beyond stupid if they really did. > you can easily blow the stack for real production grade implementations using recursion recursive solution doesn't automatically mean using a the method stack. you can implement recursive solutions using explicit stack . > dynamic programming proper please. There is no "proper" dynamic programming. Please watch this MIT intro ▶ this video .
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: ▶ this video
You may also like a couple of lectures by Erik Demaine: Dynamic Programming I: Fibonacci, Shortest Paths ▶ this video Dynamic Programming II: Text Justification, Blackjack link
When you deal with large data sets (e.g. Hadoop/Spark...), BigO starts to hit badly. Dynamic Programming also requires you to have a clue about it. See ▶ this video for some cool explanations.