Automated Transcript

Hey, what's up everyone. It's time for another quick video. And this time we're all the way up to week six. So almost there, right? Roughly after this week, it'll be roughly 75% of the way through the 60 day crash course. And I'm proud of each and every one of you for getting here. It's been tough on all ends.

Definitely a lot more feedback than I expected. One thing that I'm going to do is I'm going to start sending out change logs for each week. So every time we go through a week in the 60 day crash course, we've been making just tons of changes to the tutorials based on user feedback based on questions that we've received.

Especially around a level of difficulty of certain tutorials. And so we definitely want to make sure you know, that we're addressing those things. And so I'm going to add some links in the email and tutorial to the change logs for the last few weeks we have a QA person who's explicitly going through the crash course right now just to like, make sure everything's fine.

I, in addition to myself trying to field all these questions and yeah, just be on the lookout for that. So for week six, February 7th, to February 13th, we're going to mostly be covering trees and graphs. So trees and graphs are extremely crucial for coding interviews, especially at Fang level companies or large financial companies. They really want to see that you understand some of these more graphical non-linear kind of data structures and the algorithms that accompanied them.

So. We're going to start off by learning how to balance a binary tree. You'll hear that term come up. Occasionally to this act of balancing a binary tree, it's useful to know it may not come up that often. But it helps to round out your knowledge about trees. Then we'll cover in order traversal.

And this tutorial is actually a little bit of a misnomer because it covers in order post order and pre-order traversals. So you definitely want to make sure you get this one right. Then we're going to cover another hard array problem. Max rectangle in a histogram, it's also comes up pretty often.

It's also referred to as the skyline problem. So you may see that then just in a refresher, I try to incorporate other types of data structures in each week, just to make sure you continue to get that practice. So we're going to learn to reverse a link list this week. And then we're going to cover tri data structures, which is a specific kind of a tree that you should know it's really useful for auto-completion and things of that nature requiring fast search and then mean per level and max per level.

We'll round out our understanding of trees and X specifically around using BFS or DFS for Certain purposes, then we're going to go into graphs. I'm going to talk about just graphs, generally what they are and how they work. Then we're going to go through another tree exercise just to really narrow that down.

Then we're going to, at the end of the week, implement the graph, using a few different ways. So that's week six. There's about 12 lessons. So I'll make sure if you're trying to do all of them, try to get about two a day done. The first, the majority of it is really mastering trees and then introducing graphs as usual.

If you have any questions, feel free to reach out. I read every email. I read every comment. And yeah, best of luck and let me know how it goes. Okay.