Hi folks,

It's week 7-- great job and thanks for getting all the way here! Unfortunately I've had some personal issues come up this week preventing me from making videos, but rest assured the team and I are still available for questions and help.

Week 7 is likely the most intense out of the entire crash course. Now that we've covered all of the fundamental data structures and played around with their implementations, we're diving into some of the more advanced and tricky concepts that may come up.

We'll start off with some dynamic programming tutorials and then quickly shift into graph problems... that don't look like graph problems at first. After that, we'll try some challenges that tie a bunch of the concepts together. Then later in the week, we'll review trees and wrap up with some memoization.

The most important tutorials to hit this week are: How Does DP Work? and Design A Least Recently Used Cache.

As always, feel free to reach out with any questions.