JavaScript Algorithms and Data Structures Masterclass

Focused View

Colt Steele

21:44:26

19 View

01 - Introduction

001 Curriculum Walkthrough.mp4

07:43

002 Join The Community!.html

003 What Order Should You Watch In.mp4

02:52

004 How Im Running My Code.mp4

03:21

02 - Big O Notation

001 Intro to Big O.mp4

07:41

002 Timing Our Code.mp4

10:19

002 add-up-to-faster.zip

002 add-up-to-slower.zip

003 Counting Operations.mp4

04:36

004 Visualizing Time Complexities.mp4

04:25

005 Official Intro to Big O.mp4

09:58

006 Simplifying Big O Expressions.mp4

09:32

009 Space Complexity.mp4

06:26

011 Logs and Section Recap.mp4

08:46

external-links.txt

03 - Analyzing Performance of Arrays and Objects

001 PREREQUISITES.html

002 Section Introduction.mp4

01:43

003 The BIG O of Objects.mp4

05:31

005 When are Arrays Slow.mp4

06:25

006 Big O of Array Methods.mp4

05:56

external-links.txt

04 - Problem Solving Approach

001 PREREQUISITES.html

002 Introduction to Problem Solving.mp4

07:08

003 Step 1 Understand The Problem.mp4

07:59

004 Step 2 Concrete Examples.mp4

06:19

005 Step 3 Break It Down.mp4

07:45

006 Step 4 Solve Or Simplify.mp4

10:32

007 Step 5 Look Back and Refactor.mp4

16:57

008 Recap and Interview Strategies.mp4

04:12

external-links.txt

05 - Problem Solving Patterns

001 PREREQUISITES.html

002 Intro to Problem Solving Patterns.mp4

02:56

003 Frequency Counter Pattern.mp4

15:11

003 same-naive-solution.zip

003 same-refactored-solution.zip

004 Frequency Counter Anagram Challenge.mp4

02:33

006 Anagram Challenge Solution.mp4

06:18

006 anagram.zip

007 Multiple Pointers Pattern.mp4

09:42

007 sum-zero-naive.zip

008 Multiple Pointers Count Unique Values Challenge.mp4

04:29

010 Count Unique Values Solution.mp4

06:31

010 unique-values.zip

011 Sliding Window Pattern.mp4

13:14

011 max-sum-naive.zip

011 max-sum-refactored.zip

012 Divide And Conquer Pattern.mp4

07:02

external-links.txt

06 - 100% OPTIONAL Challenges

001 IMPORTANT NOTE!.html

004 SOLUTIONS PART 1.html

007 SOLUTIONS PART 2.html

011 SOLUTIONS PART 3.html

07 - Recursion

001 PREREQUISITES.html

002 Story Time Martin & The Dragon.mp4

07:06

003 Why Use Recursion.mp4

05:53

004 The Call Stack.mp4

07:07

004 callstack-example.zip

005 Our First Recursive Function.mp4

05:11

005 countdown.zip

007 Our Second Recursive Function.mp4

07:54

007 sumrange.zip

008 Writing Factorial Iteratively.mp4

02:19

008 factorial-iterative.zip

009 Writing Factorial Recursively.mp4

03:15

009 factorial-recursive.zip

010 Common Recursion Pitfalls.mp4

05:07

011 Helper Method Recursion.mp4

06:23

011 helper-method-recursion.zip

012 Pure Recursion.mp4

07:45

012 collect-odds-pure-recursion.zip

external-links.txt

08 - Recursion Problem Set

001 START HERE!.html

007 SOLUTIONS FOR THIS SECTION.html

09 - Bonus CHALLENGING Recursion Problems

001 NOTE ON THIS SECTION.html

006 SOLUTIONS PART 1.html

012 SOLUTIONS PART 2.html

10 - Searching Algorithms

001 PREREQUISITES.html

002 Intro to Searching.mp4

04:04

003 Intro to Linear Search.mp4

04:47

005 Linear Search Solution.mp4

05:18

005 linear-search.zip

006 Linear Search BIG O.mp4

01:55

007 Intro to Binary Search.mp4

05:47

008 Binary Search PseudoCode.mp4

02:40

010 Binary Search Solution.mp4

16:41

010 binary-search.zip

011 Binary Search BIG O.mp4

06:09

012 Naive String Search.mp4

04:38

013 Naive String Search Implementation.mp4

12:30

013 string-search.zip

external-links.txt

11 - Bubble Sort

001 PREREQUISITES.html

002 Introduction to Sorting Algorithms.mp4

08:35

003 Built-In JavaScript Sorting.mp4

04:40

004 Bubble Sort Overview.mp4

07:21

005 Bubble Sort Implementation.mp4

09:58

005 bubble-unoptimized.zip

006 Bubble Sort Optimization.mp4

04:22

006 optimized-bubble.zip

007 Bubble Sort BIG O Complexity.mp4

01:28

external-links.txt

12 - Selection Sort

001 PREREQUISITES.html

002 Selection Sort Introduction.mp4

06:18

003 Selection Sort Implementation.mp4

11:14

003 selection-sort.zip

004 Selection Sort Big O Complexity.mp4

01:40

external-links.txt

13 - Insertion Sort

001 PREREQUISITES.html

002 Insertion Sort Introduction.mp4

03:17

003 Insertion Sort Implementation.mp4

10:42

003 insertion-sort.zip

004 Insertion Sort BIG O Complexity.mp4

02:24

external-links.txt

14 - Comparing Bubble, Selection, and Insertion Sort

001 Comparing Bubble, Selection, and Insertion Sort.mp4

05:33

external-links.txt

15 - Merge Sort

001 PREREQUISITES.html

002 Intro to the Crazier Sorts.mp4

06:05

003 Merge Sort Introduction.mp4

05:25

004 Merging Arrays Intro.mp4

05:11

005 Merging Arrays Implementation.mp4

06:55

005 mergearrays.zip

006 Writing Merge Sort Part 1.mp4

02:21

007 Writing Merge Sort Part 2.mp4

12:37

007 mergesort.zip

008 Merge Sort BIG O Complexity.mp4

06:22

external-links.txt

16 - Quick Sort

001 PREREQUISITES.html

002 Introduction to Quick Sort.mp4

09:00

003 Pivot Helper Introduction.mp4

08:06

004 Pivot Helper Implementation.mp4

08:08

004 pivot.zip

005 Quick Sort Implementation.mp4

08:46

005 quicksort.zip

006 Quick Sort Call Stack Walkthrough.mp4

04:15

007 Quick Sort Big O Complexity.mp4

04:06

external-links.txt

17 - Radix Sort

001 PREREQUISITES.html

002 Radix Sort Introduction.mp4

09:22

003 Radix Sort Helper Methods.mp4

11:10

003 radix-helpers.zip

004 Radix Sort Pseudocode.mp4

04:18

005 Radix Sort Implementation.mp4

10:25

005 radix-sort.zip

006 Radix Sort BIG O Complexity.mp4

03:51

external-links.txt

18 - Data Structures Introduction

001 Which Data Structure Is The Best.mp4

12:38

002 ES2015 Class Syntax Overview.mp4

05:14

003 Data Structures The Class Keyword.mp4

06:37

003 class-keyword.zip

004 Data Structures Adding Instance Methods.mp4

09:49

004 instance-methods.zip

005 Data Structures Adding Class Methods.mp4

07:11

005 point-class.zip

005 student-class.zip

external-links.txt

19 - Singly Linked Lists

001 PREREQUISITES.html

002 Intro to Singly Linked Lists.mp4

07:47

003 Starter Code and Push Intro.mp4

07:22

003 singly-linked-list-structure.zip

004 Singly Linked List Push Solution.mp4

04:24

004 singly-linked-list-push.zip

005 Singly Linked List Pop Intro.mp4

06:14

006 Singly Linked List Pop Solution.mp4

07:35

006 singly-linked-list-pop.zip

007 Singly Linked List Shift Intro.mp4

01:31

008 Singly Linked List Shift Solution.mp4

03:22

008 singly-linked-list-shift.zip

009 Singly Linked List Unshift Intro.mp4

01:34

010 Singly Linked List Unshift Solution.mp4

05:58

010 singly-linked-list-unshift.zip

011 Singly Linked List Get Intro.mp4

02:32

012 Singly Linked List Get Solution.mp4

03:32

012 singly-linked-list-get.zip

013 Singly Linked List Set Intro.mp4

01:26

014 Singly Linked List Set Solution.mp4

02:10

014 singly-linked-list-set.zip

015 Singly Linked List Insert Intro.mp4

04:27

016 Singly Linked List Insert Solution.mp4

07:49

016 singly-linked-list-insert.zip

017 Singly Linked List Remove Intro.mp4

01:56

018 Singly Linked List Remove Solution.mp4

03:15

018 singly-linked-list-remove.zip

019 Singly Linked List Reverse Intro.mp4

04:46

020 Singly Linked List Reverse Solution.mp4

08:58

020 singly-linked-list-reverse.zip

021 Singly Linked List BIG O Complexity.mp4

05:41

external-links.txt

20 - Doubly Linked Lists

001 PREREQUISITES.html

002 Doubly Linked Lists Introduction.mp4

04:43

003 Setting Up Our Node Class.mp4

03:00

003 dll-classes.zip

004 Push.mp4

02:10

005 Push Solution.mp4

04:04

005 dll-push.zip

006 Pop.mp4

03:20

007 Pop Solution.mp4

06:23

007 dll-pop.zip

008 Shift.mp4

02:44

009 Shift Solution.mp4

04:12

009 dll-shift.zip

010 Unshift.mp4

01:36

011 Unshift Solution.mp4

02:19

011 dll-unshift.zip

012 Get.mp4

04:02

013 Get Solution.mp4

07:04

013 dll-get.zip

014 Set.mp4

01:18

015 Set Solution.mp4

02:08

015 dll-set.zip

016 Insert.mp4

02:50

017 Insert Solution.mp4

06:48

017 dll-insert.zip

018 Remove.mp4

02:18

019 Remove Solution.mp4

06:28

019 dll-remove.zip

020 Comparing Singly and Doubly Linked Lists.mp4

04:32

external-links.txt

21 - Stacks + Queues

001 PREREQUISITES.html

002 Intro to Stacks.mp4

06:19

003 Creating a Stack with an Array.mp4

07:05

004 Writing Our Own Stack From Scratch.mp4

11:33

004 stack.zip

005 BIG O of Stacks.mp4

02:15

006 Intro to Queues.mp4

04:14

007 Creating Queues Using Arrays.mp4

03:25

008 Writing Our Own Queue From Scratch.mp4

10:24

008 queue.zip

009 BIG O of Queues.mp4

02:30

external-links.txt

22 - Binary Search Trees

001 PREREQUISITES.html

002 Introduction to Trees.mp4

06:46

003 Uses For Trees.mp4

06:32

004 Intro to Binary Trees.mp4

05:54

005 POP QUIZ!.mp4

01:13

006 Searching A Binary Search Tree.mp4

02:55

007 Our Tree Classes.mp4

02:45

007 bst-classes.zip

008 BST Insert.mp4

03:50

009 BST Insert Solution.mp4

11:53

009 bst-insert.zip

010 BST Find.mp4

04:42

011 BST Find Solution.mp4

05:36

011 bst-find.zip

012 Big O of Binary Search Trees.mp4

05:59

external-links.txt

23 - Tree Traversal

001 PREREQUISITES.html

002 Intro To Tree Traversal.mp4

04:50

003 Breadth First Search Intro.mp4

05:52

004 Breadth First Search Solution.mp4

06:20

004 breadth-first-tree.zip

005 Depth First PreOrder Intro.mp4

05:37

006 Depth First PreOrder Solution.mp4

06:50

006 depth-first-tree.zip

007 Depth First PostOrder Intro.mp4

04:02

008 Depth First PostOrder Solution.mp4

02:38

008 depth-first-tree.zip

009 Depth First InOrder Intro.mp4

02:07

010 Depth First InOrder Solution.mp4

02:32

010 depth-first-tree.zip

011 When to Use BFS and DFS.mp4

07:37

external-links.txt

24 - Binary Heaps

001 PREREQUISITES.html

002 Intro to Heaps.mp4

07:30

003 Storing Heaps.mp4

07:05

004 Heap Insert Intro.mp4

09:14

005 Heap Insert Solution.mp4

10:51

005 max-binary-heap-insert.zip

006 Heap ExtractMax Intro.mp4

08:28

007 Heap ExtractMax Solution.mp4

17:56

007 max-binary-heap-insert.zip

008 Priority Queue Intro.mp4

08:59

009 Priority Queue Pseudocode.mp4

03:43

010 Priority Queue Solution.mp4

09:21

010 priority-queue.zip

011 BIG O of Binary Heaps.mp4

08:54

external-links.txt

25 - Hash Tables

001 PREREQUISITES.html

002 Intro to Hash Tables.mp4

05:50

003 More About Hash Tables.mp4

04:32

004 Intro to Hash Functions.mp4

06:11

005 Writing Our First Hash Function.mp4

08:27

005 basic-hash.zip

006 Improving Our Hash Function.mp4

07:10

006 improved-hash.zip

007 Handling Collisions.mp4

03:59

008 Hash Table Set and Get.mp4

04:02

009 Hash Table Set Solution.mp4

05:14

009 hash-table-set-and-get.zip

010 Hash Table Get Solution.mp4

06:43

010 hash-table-set-and-get.zip

011 Hash Table Keys and Values.mp4

01:41

012 Hash Table Keys and Values Solution.mp4

08:43

012 hash-table-keys-and-values.zip

013 Hash Table Big O Complexity.mp4

05:41

external-links.txt

26 - Graphs

001 PREREQUISITES.html

002 Intro to Graphs.mp4

03:50

003 Uses for Graphs.mp4

07:57

004 Types of Graphs.mp4

08:49

005 Storing Graphs Adjacency Matrix.mp4

03:57

006 Storing Graphs Adjacency List.mp4

02:29

007 Adjacency Matrix Vs. List BIG O.mp4

05:51

008 Add Vertex Intro.mp4

02:10

009 Add Vertex Solution.mp4

02:54

009 graph-add-vertex.zip

010 Add Edge Intro.mp4

02:32

011 Add Edge Solution.mp4

02:11

011 graph-add-edge.zip

012 Remove Edge Intro.mp4

01:35

013 Remove Edge Solution.mp4

02:42

013 graph-remove-edge.zip

014 Remove Vertex Intro.mp4

02:35

015 Remove Vertex Solution.mp4

04:34

015 graph-remove-vertex.zip

external-links.txt

27 - Graph Traversal

001 PREREQUISITES.html

002 Intro to Graph Traversal.mp4

08:38

003 Depth First Graph Traversal.mp4

08:30

004 DFS Recursive Intro.mp4

07:27

005 DFS Recursive Solution.mp4

12:45

005 graph-dfs-recursive.zip

006 DFS Iterative Intro.mp4

03:37

007 DFS Iterative Solution.mp4

08:44

007 graph-dfs-iterative.zip

008 Breadth First Graph Traversal.mp4

02:59

009 BFS Intro.mp4

02:27

010 BFS Solution.mp4

08:09

010 graph-bfs.zip

external-links.txt

28 - Dijkstras Algorithm!

001 PREREQUISITES.html

002 Intro to Dijkstras and Prerequisites.mp4

02:41

003 Who was Dijkstra and what is his Algorithm.mp4

09:00

004 Writing a Weighted Graph.mp4

05:20

004 weightedgraph.zip

005 Walking through the Algorithm.mp4

16:26

006 Introducing Our Simple Priority Queue.mp4

03:48

006 simplepriorityqueue.zip

007 Dijkstras Pseudo-Code.mp4

04:28

008 Implementing Dijkstras Algorithm.mp4

21:18

008 dijkstra-version1.zip

009 Upgrading the Priority Queue.mp4

01:52

009 dijkstras-version2.zip

external-links.txt

29 - Dynamic Programming

001 Intro to Dynamic Programming.mp4

05:03

002 Overlapping Subproblems.mp4

05:59

003 Optimal Substructure.mp4

06:28

004 Writing A Recursive Solution.mp4

06:43

005 Time Complexity of Our Solution.mp4

04:11

006 The Problem With Our Solution.mp4

03:39

007 Enter Memoization!.mp4

09:00

008 Time Complexity of Memoized Solution.mp4

03:27

009 Tabulation A Bottom Up Approach.mp4

06:59

external-links.txt

30 - The Wild West

001 VERY IMPORTANT NOTE! PLEASE READ!.html

Description

The Missing Computer Science and Coding Interview Bootcamp

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

Who is this for?

Anyone preparing for programming interviews

Anyone interested in improving their problem solving skills

Anyone looking to become a better developer!

What You Need to Know?

Basic knowledge of JavaScript syntax

NO experience with data structures or computer science needed!

More details

Description
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!
Who this course is for:
Anyone preparing for programming interviews
Anyone interested in improving their problem solving skills
Anyone looking to become a better developer!

User Reviews

Rating

average 0

Total votes0

Focused display

Hi! I'm Colt. I'm a developer with a serious love for teaching. I've spent the last few years teaching people to program at 2 different immersive bootcamps where I've helped hundreds of people become web developers and change their lives. My graduates work at companies like Google, Salesforce, and Square.Most recently, I led Galvanize's SF's 6 month immersive program as Lead Instructor and Curriculum Director. After graduating from my class, 94% of my students went on to receive full-time developer roles. I also worked at Udacity as a Senior Course Developer on the web development team where I got to reach thousands of students daily. I’ve since focused my time on bringing my classroom teaching experience to an online environment. In 2016 I launched my Web Developer Bootcamp course, which has since gone on to become one of the best selling and top rated courses on Udemy. I was also voted Udemy’s Best New Instructor of 2016. I've spent years figuring out the "formula" to teaching technical skills in a classroom environment, and I'm really excited to finally share my expertise with you. I can confidently say that my online courses are without a doubt the most comprehensive ones on the market. Join me on this crazy adventure!

Udemy

View courses Udemy

Students take courses primarily to improve job-related skills.Some courses generate credit toward technical certification. Udemy has made a special effort to attract corporate trainers seeking to create coursework for employees of their company.