Course Information
Registration period
Year-round Recruitment
Course Level
Study Mode
Duration
21 Hour(s) 54 Minute(s)
Language
English
Taught by
Colt Steele
Certificate
- Available
- *The delivery and distribution of the certificate are subject to the policies and arrangements of the course provider.
Rating
2 views
Course Overview
The Missing Computer Science and Coding Interview Bootcamp
Updated with a brand new section on Dynamic Programming!
This course crams months of computer science and interview prep material into 20 hours of video. The content is based directly on the last semester of my in-person coding bootcamps, where my students go on to land 6-figure developer jobs. I cover the exact same computer science content that has helped my students ace interviews at huge companies like Google, Tesla, Amazon, and Facebook. Nothing is watered down for an online audience; this is the real deal :) We start with the basics and then eventually cover “advanced topics” that similar courses shy away from like Heaps, Graphs, and Dijkstra’s Shortest Path Algorithm.
I start by teaching you how to analyze your code’s time and space complexity using Big O notation. We cover the ins and outs of Recursion. We learn a 5-step approach to solving any difficult coding problem. We cover common programming patterns. We implement popular searching algorithms. We write 6 different sorting algorithms: Bubble, Selection, Insertion, Quick, Merge, and Radix Sort. Then, we switch gears and implement our own data structures from scratch, including linked lists, trees, heaps, hash tables, and graphs. We learn to traverse trees and graphs, and cover Dijkstra's Shortest Path Algorithm. The course also includes an entire section devoted to Dynamic Programming.
Here's why this course is worth your time:
It's interactive - I give you a chance to try every problem before I show you my solution.
Every single problem has a complete solution walkthrough video as well as accompanying solution file.
I cover helpful "tips and tricks" to solve common problems, but we also focus on building an approach to ANY problem.
It's full of animations and beautiful diagrams!
Are you looking to level-up your developer skills? Sign up today!
Course Content
- 29 section(s)
- 250 lecture(s)
- Section 1 Introduction
- Section 2 Big O Notation
- Section 3 Analyzing Performance of Arrays and Objects
- Section 4 Problem Solving Approach
- Section 5 Problem Solving Patterns
- Section 6 100% OPTIONAL Challenges
- Section 7 Recursion
- Section 8 Recursion Problem Set
- Section 9 Bonus CHALLENGING Recursion Problems
- Section 10 Searching Algorithms
- Section 11 Bubble Sort
- Section 12 Selection Sort
- Section 13 Insertion Sort
- Section 14 Comparing Bubble, Selection, and Insertion Sort
- Section 15 Merge Sort
- Section 16 Quick Sort
- Section 17 Radix Sort
- Section 18 Data Structures Introduction
- Section 19 Singly Linked Lists
- Section 20 Doubly Linked Lists
- Section 21 Stacks + Queues
- Section 22 Binary Search Trees
- Section 23 Tree Traversal
- Section 24 Binary Heaps
- Section 25 Hash Tables
- Section 26 Graphs
- Section 27 Graph Traversal
- Section 28 Dijkstra's Algorithm!
- Section 29 Dynamic Programming
What You’ll Learn
- Learn everything you need to ace difficult coding interviews
- Master dozens of popular algorithms, including 6 sorting algorithms!
- Implement 10+ data structures from scratch
- Improve your problem solving skills and become a stronger developer
Reviews
-
SSandesh Nangare
Before this course, DSA felt like a nightmare with infinite recursion. But your step-by-step guidance acted like the perfect base case—bringing everything back under control. Your support during the tougher topics was like having an optimal path always available. And your explanation of Dijkstra’s algorithm? Let’s just say it has permanent priority in my mental queue! Thank you for being an exceptional instructor. I’d definitely recommend this course to anyone wanting to sort out their DSA journey efficiently.
-
AAbigail J Figaro
I love the way Colt teaches. This is the second course I've completed from him and the way he explains things I just get it. I was very disappointed by the exercises though. He basically teaches you the basic concepts and then immediately asks you to regurgitate what you've just seen. Instead it would have been nice if for each section he pick out a common interview question, maybe from the blind 75, and explained how the concept applies to a common question. The jump between what's taught in this course and what you'll actually be asked in an interview is hard. It would've been nice to be able to build a strategy to identify common patterns so that users felt more prepared for interviews after the course. I feel like I've been bamboozled because I was led to believe this would help with interview prep. It's like he teaches you the alphabet only and the test will be asking you to write an essay.
-
AAndrew Zhang
A really good course. Colt is a great teacher and the content covered the most common concepts in data structure and algorithm. The course can really help learner to quickly get the idea of basic algorithms and lay a good foundation for further learning.
-
JJuliet George
I took this course 4 years ago as a new programmer. I came back to it for his explanation of Djikstra algorithm and Dynamic Programming. He is very good at explaining.
