[CodeWithMosh]The Ultimate Data Structures & Algorithms: Part 3

What you will learn

This course is the third of a series. In the first part, we covered the linear data structures (Arrays, Linked Lists, Stacks, Queues and Hash Tables). In the second part, we covered the non-linear data structures (Binary Trees, AVL Trees, Heaps, Tries and Graphs). Part 3 explores additional algorithms that every developer must study.


Here's what you're going to learn in this part:


Searching Algorithms

Sorting Algorithms

String Manipulation Algorithms



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.

About this specialization

Ace your coding job interview. Learn to write better and faster code.

Studied Computer Science - but never really understood the complex topic of data structures and algorithms?


Or maybe you’re a self-taught programmer, with little to no knowledge of this important topic.


Or perhaps you failed a job interview because you couldn't answer basic data structure and algorithm questions.


So, why are data structures so important these days?

Data structures and algorithms are patterns for solving problems. Developers who know more about data structures and algorithms are better at solving problems. That’s why companies like Google, Microsoft and Amazon always include interview questions on data structures and algorithms. They want to assess your problem-solving skills. They don't care how many programming languages and frameworks you're familiar with.

By the end of this course…

You’ll be able to:


Ace your next coding interview

Write better, faster code

Become a better developer

Improve your problem solving skills

Master computer science fundamentals

Implement all the essential data structures from scratch

Master dozens of popular algorithms

Syllabus
Module 1:
Getting Started (1m)
View more