- Extra Resources
What You'll Learn
This course is the first of a series. In this part, we'll be focusing on linear data structures.Part 2 is all about trees and graphs. Part 3 is about searching, sorting and string manipulation algorithms.
Here's what you're going to learn in the first part:
- The Big O notation
- Linked Lists
- Hash Tables
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