![[CodewithMosh] The Ultimate Data Structures & Algorithms: Part 2](/data/resource_icons/1/1375.jpg?1605472968){kind=icon}
- Extra Resources
- https://www.youtube.com/c/programmingwithmosh
What you're going to learn
This course is the second of a series. In the first part, we covered the linear data structures (Arrays, Linked Lists, Stacks, Queues and Hash Tables). In this part, we'll be focusing on non-linear data structures.Part 3 is about searching, sorting and string manipulation algorithms.
Here's what you're going to learn in this part:
- Binary Trees
- AVL Trees
- Heaps
- Tries
- Graphs
This is the most comprehensive data structures and algorithms series online. Every example and exercise is picked from popular interview questions asked by Google, Microsoft, Amazon and other big companies.
Most data structure books and courses are too academic and boring. They have too much math and their code looks ugly, old and disgusting! This course is fun and easy to follow and shows you how to write beautiful code like a software engineer, not a mathematician.
Who is this course for?
- Anyone preparing for a coding job interview
- Computer science students whose lecturers failed to explain the topics
- Self-taught developers who missed out on a computer science degree
- Anyone who wants to become a better developer
Requirements
In this course, I use Java to teach the concepts but you can apply these concepts in any programming language. Our focus is on data structures and algorithms, not programming languages and tools.
All you need to take this course are some basic programming skills. If you know variables, loops, and conditional statements, you're good. If you need a quick refresher to get up to speed with Java syntax, you can watch the first part of my Java series.
Ideally, you should have taken the first part of this series as the concepts and exercises in this part are more complex than those covered in the first part.
