Data Structures and Algorithms in JavaScript
Kyle Shevlin
This course teaches you how to implement your first data structures and algorithms. In the process, you’ll learn some fundamental computer science concepts as well. We’ll build these from scratch using JavaScript, but what we learn can be taken and used in any other language, too.
You will learn how to build: queues, stacks, linked lists, graphs, and trees. You’ll learn to implement several different sorting algorithms: bubble, insert, merge, and quick. Each of these lessons will not only teach you their implementation, but the tradeoffs made in choosing one over another. By proxy, you’ll learn about concepts like Big O notation and recursion.
Learner Reviews
- What did you like about this course?
Exactly what I was looking for. An intro to ds and algos for people who already know how to code
Learner4 years ago - What did you like about this course?
This is great content, and exactly what I was looking for to prepare for technical interviews. It would be nice to have a follow up video at the end of each algorithm that explains the pros/cons of each algorithm and some examples where they could be used vs other alternatives.
kylecase4 years ago - What did you like about this course?
Data structures and algorithms can seem so intimidating, but Kyle explained each one so simply and concisely that I feel confident that I could do the same.
Kasey Cowley5 years ago - What did you like about this course?
Thank you Kyle! I really like the way you teach and definitely that you using functions in your data structures!
Marcell Ciszek5 years ago - What did you like about this course?
Loved the course, would love one going deeper, with other data structures, or using the data structures to accomplish things.
Gus Saiani5 years ago - What did you like about this course?
Amazing course, I would love to see more of these algorithms being use in the wild. One of my biggest issues is knowing what kind of situation takes a specific type of algorithm. Thank you!
Aaron Ponce5 years ago
