Revised Transcript
Hello everyone! I'm happy to be back after recovering from an illness. Now that I'm feeling better, we can continue our bi-weekly algorithm tutorial videos.
This week, we'll be diving into the subsets pattern. But first, I wanted to mention some recent improvements made to AlgoDaily based on your feedback:
We've added constraints to every problem, like time complexity, space complexity, and input format. This gives you practice discussing constraints like you would in a real interview.
We completely redid the Merging Intervals tutorial with extra examples and diagrams to make the concepts clearer. This will prepare you for this week's Merging Intervals coding challenge.
We have a major site redesign launching soon to improve the user experience. Please check it out on the home page and let me know your thoughts!
Now, here is what we'll cover this week:
Apply the subsets pattern to generate all string permutations
Arrays and strings fundamentals refresher by adding zeros
Put our new Merging Intervals knowledge into practice on a coding challenge
Introduce linked lists - a key data structure
- Go in-depth with a linked list tutorial
- Implement a linked list from scratch
- Solve a problem using linked lists
That wraps up what we have planned for week 3. Thank you for watching and let me know if you have any other suggestions!
