Automated Transcript

Hey folks. It's Jake here. Another quick update. We're going to start week two now. And it seems like week one went pretty well for everybody. I got about 30 emails, old, old toad after week one. Or during week one a lot of people are enjoying the course. There was some good feedback as well around.

How to better structure the course and around topics and concepts that people were struggling with. And so thank you all for writing in posting onto the discussion sharing it on social hashtag LOL daily or hashtag album daily, 60 really appreciated. We're all working together to make the course better and better.

And yeah. Just really appreciate all of the feedback and communication. So before we dive into what's up for week two and specifically we two part one, let's talk about some of the awesome messages that people have sent in that we've acted on.

So first shout out to Farman Pirzada, one of the participants of the crash course. He noted that the next button for the crash course, wasn't working and thank you so much, Farman. This has really helped. So now, if you're on one of the tutorials during the 60 day crash course, And you have crash course highlighted.

If you click next, you'll go to the next one before it was just bouncing around. So please, please, please give me updates like this. It's super helpful and we'll try to get a fix in as soon as possible. Cool

Then. Thank you so much to Rudy Becker for always sharing us on social and also for writing in about some confusion around. The interactive boxes.

So the interactive boxes are these code snippets with every challenge. And we found that a lot of people would like to take some of the concepts that were presented in those boxes and use them and try them out in their own language. So we've made an update. That you can toggle between different languages and while the snippets themselves aren't translated.

It does give you an opportunity to just try out the concept or technique that's being shown for that particular section. Right, right here. Instead of having to go to a different scratch pad or a separate place. So thank you, Rudy, for that recommendation.

and then finally shout out to amid. We got some really great feedback from Ahmed. Ahmed wrote in and talked about how some of the concepts that we use to solve the problems are a little bit challenging. So for example the use of nap, filter techniques use of rejects these could all be really intimidating for.

For new developers and people just getting started with these concepts. So what we're going to do is eventually, and this is a work in progress, but we're going to add links to all of the previous fundamental tutorials so that whenever you get stuck on one of these concepts, or whenever we use one of these techniques or patterns there's a place to refer.

So that's a work in progress. And thank you so much for that recommendation. And then the other thing is he gave feedback regarding confusion between the daily newsletter and then following the 60 day crash course as well. And that's something I hadn't considered. So thank you so much for discussing that.

I think what we'll eventually do is have the ability to temporarily pause the daily email challenge just for the time being so that. If you're following the 60 day crash course, it's not too overwhelming with kind of two different tracks going on at once.

and also I would like to thank Guarav for posting this point in the forum that the find least positive missing number problem. Had some issues and, and for inspiring me to make a video for it. All right. So without further ado, let's talk about what we're going to cover from now until Wednesday evening.

So we're first going to work through some fundamental sorting algorithms. So sorting is a huge, important topic in technical interviews because you're going to need to sort yeah. Lists and raising collections all the time and we really want to get that down. Well earlier, rather than later, then we're gonna cover, validate a palindrome, which is gonna use the two pointer technique that we learned earlier in the crash course.

So it's just a nice little refresher then. And this is something that Hmm, or Rudy had actually suggested it is to propose is to introduce the concept of hash maps earlier. And so we'll learn to implement a hash map and learn all about hash maps since lookup time, access time and insertion time is constant.

So they're they make for great data structures for use in various challenges.

Then we're going to cover immutability, mutability, and immutability. These are all fundamental building blocks for future problems.

Then we're going to do some exercises. So power of three and single lonely number are both going to utilize the concepts that we've learned prior. And then you can either stop at the binary search technique, which is a way of searching for values in a collection. You can, or you can either stop there or you can go ahead and try to get this done by a Wednesday evening.

All right. That's it for now as always, if you have any questions, feel free to reach out on the discussion thread or team@algodaily.com and I'll be in touch shortly. Best of luck.