Coding Interview Universitycurated list on GitHubRecommends
Under “Additional Detail on Some Subjects”
6.006: Dynamic Programming I: Fibonacci, Shortest Paths
0:00 / 0:00
#dynamicprogramming#fibonacci#directedacyclicgraphs
15. Dynamic Programming, Part 1: SRTBOT, Fib, DAGs, Bowling
MIT OpenCourseWare
6.5M subscribers • 36 videos on Hallway • University channel
- Recommended by 2 people: 1 in engineering communities and 1 curated list.
- Presented by Erik Demaine, Professor at MIT
Intermediate. Assumes working knowledge.
154K views5 years ago2 recommendations
Computer scienceAlgorithmsComputation and complexity
Erik Demaine introduces dynamic programming, covering recursion, memoization, Fibonacci numbers, shortest paths in DAGs, and the bowling problem.
MIT 6.006 Introduction to Algorithms, Spring 2020 Instructor: Erik Demaine View the complete course: ocw.mit.edu/6-006S20 YouTube Playlist: youtube.com/playlist?list=PLUl4u3cNGP63EdVPNLG3ToM6LaEUuStEY This is the first of four lectures on dynamic programing. This begins with how to solve a problem recursively and continues with three examples: Fibonacci, DAG shortest paths, and bowling. License: Creative Commons BY-NC-SA More information at ocw.mit.edu/terms More courses at ocw.mit.edu Support OCW at ow.ly/a1If50zVRlQ We encourage constructive comments and discussion on OCW’s YouTube and other social media channels. Personal attacks, hate speech, trolling, and inappropriate comments are not allowed and may be removed. More details at ocw.mit.edu/comments.Why it's here
2 people recommend thisWhat people say. Recommended as a foundational academic lecture for mastering dynamic programming and algorithmic problem-solving.
u/dontyougetsoupedyetin r/compsci • Recommends
On “Is leetcode relevant to algorithms study?”
The people saying that are wrong. Leetcode is meant to test your knowledge of problem solving using tools like inductive reasoning. That's why the people saying it go on about "learning patterns," there are patterns because you're supposed to be learning inductive methods of proof and applying them to the types of problems that are most easily solvable by those methods. Induction is the starting point of problem solving, that's why it's being tested for in interviews. Learn proof by induction and follow along some open courseware such as link to this video You use induction to build on while learning to solve algorithm problems using techniques like dynamic programming.