Comments by "Casper de With" (@casperdewith) on "Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths" video.

  1. caption errors 0:52 injected it → inject it 2:39 polynomial time algorithm → polynomial-time algorithm (also at 2:44) 5:18 sneak peak → sneak peek 6:17 we’re talking → when we’re talking 6:46 whatever’s → whatever, is 6:53 dynamic programming → dynamic-programming 12:02 computer → compute 19:03 non-memoize → non-memoized 21:04 that same problem → that same subproblem 31:01 onto → on to 35:32 [INAUDIBLE] → And then: okay, what’s 40:00 stored it → store it 41:45 s comma v → s comma b 45:10 Handshaking → Handshaking lemma 45:18 it ran a → it ran in 45:28 depth first search → depth-first search 48:19 refers to https://www.youtube.com/watch?v=OQSNhk5ICTI 50:52 negative weight cycles → negative-weight cycles
    5