4.73 out of 5
4.73
2891 reviews on Udemy

JavaScript Algorithms and Data Structures Masterclass

The Missing Computer Science and Coding Interview Bootcamp
Instructor:
Colt Steele
19,567 students enrolled
English [Auto-generated] More
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

Updated in November 2018 with 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 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!

Introduction

1
Curriculum Walkthrough
2
What Order Should You Watch In?
3
How I'm Running My Code

Big O Notation

1
Intro to Big O
2
Timing Our Code
3
Counting Operations
4
Visualizing Time Complexities
5
Official Intro to Big O
6
Simplifying Big O Expressions
7
Big O Time Complexity Quiz
8
Big O Time Complexity Quiz 2
9
Space Complexity
10
Big O Space Complexity Quiz
11
Logs and Section Recap

Analyzing Performance of Arrays and Objects

1
PREREQUISITES
2
Section Introduction
3
The BIG O of Objects
4
Object Operations Quiz
5
When are Arrays Slow?
6
Big O of Array Methods
7
Array Operations Quiz

Problem Solving Approach

1
PREREQUISITES
2
Introduction to Problem Solving
3
Step 1: Understand The Problem
4
Step 2: Concrete Examples
5
Step 3: Break It Down
6
Step 4: Solve Or Simplify
7
Step 5: Look Back and Refactor
8
Recap and Interview Strategies

Problem Solving Patterns

1
PREREQUISITES
2
Intro to Problem Solving Patterns
3
Frequency Counter Pattern
4
Frequency Counter: Anagram Challenge
5
Frequency Counter - validAnagram
6
Anagram Challenge Solution
7
Multiple Pointers Pattern
8
Multiple Pointers: Count Unique Values Challenge
9
Multiple Pointers - countUniqueValues
10
Count Unique Values Solution
11
Sliding Window Pattern
12
Divide And Conquer Pattern

100% OPTIONAL Challenges

1
IMPORTANT NOTE!
2
Frequency Counter - sameFrequency
3
Frequency Counter / Multiple Pointers - areThereDuplicates
4
SOLUTIONS PART 1
5
Multiple Pointers - averagePair
6
Multiple Pointers - isSubsequence
7
SOLUTIONS PART 2
8
Sliding Window - maxSubarraySum
9
Sliding Window - minSubArrayLen
10
Sliding Window - findLongestSubstring
11
SOLUTIONS PART 3

Recursion

1
PREREQUISITES
2
Story Time: Martin & The Dragon
3
Why Use Recursion?
4
The Call Stack
5
Our First Recursive Function
6
Recursion Quiz
7
Our Second Recursive Function
8
Writing Factorial Iteratively
9
Writing Factorial Recursively
10
Common Recursion Pitfalls
11
Helper Method Recursion
12
Pure Recursion

Recursion Problem Set

1
START HERE!
2
power
3
factorial
4
productOfArray
5
recursiveRange
6
fib
7
SOLUTIONS FOR THIS SECTION

Bonus CHALLENGING Recursion Problems

1
NOTE ON THIS SECTION
2
reverse
3
isPalindrome
4
someRecursive
5
flatten
6
SOLUTIONS PART 1
7
capitalizeFirst
8
nestedEvenSum
9
capitalizeWords
10
stringifyNumbers
11
collectStrings
12
SOLUTIONS PART 2

Searching Algorithms

1
PREREQUISITES
2
Intro to Searching
3
Intro to Linear Search
4
Linear Search Exercise
5
Linear Search Solution
6
Linear Search BIG O
7
Intro to Binary Search
You can view and review the lecture materials indefinitely, like an on-demand channel.
Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don't have an internet connection, some instructors also let their students download course lectures. That's up to the instructor though, so make sure you get on their good side!
4.7
4.7 out of 5
2891 Ratings

Detailed Rating

Stars 5
2053
Stars 4
682
Stars 3
125
Stars 2
19
Stars 1
12
f50122a054e1009aa9e585bc832dda50
30-Day Money-Back Guarantee

Includes

22 hours on-demand video
32 articles
Full lifetime access
Access on mobile and TV
Certificate of Completion
Demos
Support Buy $0