Lesson 19: Dynamic Programming I: Fibonacci, Shortest Paths