JavaScript Data Structures & Algorithms

JavaScript Data Structures & Algorithms

English | MP4 | AVC 1280×720 | AAC 44KHz 2ch | 103 lectures (6h 52m) | 1.09 GB

DSA for the Cracking the Coding Interview. Animated Examples for Faster Learning and Deeper Understanding.

Welcome to Data Structures & Algorithms in JavaScript

This course makes learning to code fun and makes hard concepts easy to understand.

How did I do this? By using animations!

Animating the Data Structures & Algorithms makes everything more visually engaging and allows students to learn more material – in less time – with higher retention (a pretty good combination).

I will use these visuals to guide you, step-by-step, through the entire course.

The course also includes dozens-and-dozens of Coding Exercises. So you can immediately put everything into practice as soon as you learn it (a very important step).

All of this will help you to feel more confident and prepared when you walk into a coding interview.

Here are the topics we will cover:

Technical

  • Big O notation

Data Structures

  • Arrays
  • Linked Lists
  • Doubly Linked Lists
  • Stacks & Queues
  • Binary Trees
  • Hash Tables
  • Graphs

Algorithms

  • Sorting
  • Bubble Sort
  • Selection Sort
  • Insertion Sort
  • Merge Sort
  • Quick Sort

Searching

  • Breadth First Search
  • Depth First Search

What you’ll learn

  • 48 Coding Exercises
  • Learn DSA Faster with Animated Examples
  • Mastery of Data Structures and Algorithms
  • Confidently Answer Technical Interview Questions
  • Time and Space Complexity of Data Structures and Algorithms
  • Strengthen Your Skills as a Developer
Table of Contents

Introduction
1 Introduction
2 Course Overview
3 Code Editor

Big O
4 Big O Intro
5 Big O Worst Case
6 Big O O(n)
7 Big O Drop Constants
8 Big O O(n^2)
9 Big O Drop Non-Dominants
10 Big O O(1)
11 Big O O(log n)
12 Big O Different Terms for Input
13 Big O Arrays
14 Big O Wrap Up

Classes & Pointers
15 Classes
16 Pointers

Data Structures Linked Lists
17 Linked List Intro
18 LL Big O
19 LL Under the Hood
20 LL Constructor
21 Coding Exercises (Important)
22 LL Push
23 LL Pop – Intro
24 LL Pop – Code
25 LL Unshift
26 LL Shift
27 LL Get
28 LL Set
29 LL Insert
30 LL Remove
31 LL Reverse

Data Structures Doubly Linked Lists
32 DLL Constructor
33 DLL Push
34 DLL Pop
35 DLL Unshift
36 DLL Shift
37 DLL Get
38 DLL Set
39 DLL Insert
40 DLL Remove

Data Structures Stacks & Queues
41 Stack Intro
42 Stack Constructor
43 Stack Push
44 Stack Pop
45 Queue Intro
46 Queue Constructor
47 Queue Enqueue
48 Queue Dequeue

Data Structures Trees
49 Trees Intro & Terminology
50 Binary Search Trees Example
51 BST Big O
52 BST Constructor
53 BST Insert – Intro
54 BST Insert – Code
55 BST Contains
56 BST Minimum Value

Data Structures Hash Tables
57 Hash Table Intro
58 HT Collisions
59 HT Constructor
60 HT Set
61 HT Get
62 HT Keys
63 HT Big O
64 HT Interview Question

Data Structures Graphs
65 Graph Intro
66 Graph Adjacency Matrix
67 Graph Adjacency List
68 Graph Big O
69 Graph Add Vertex
70 Graph Add Edge
71 Graph Remove Edge
72 Graph Remove Vertex

Algorithms Recursion
73 Recursion Intro
74 Call Stack
75 Factorial

Algorithms Basic Sorts
76 Bubble Sort Intro
77 Bubble Sort Code
78 Selection Sort Intro
79 Selection Sort Code
80 Insertion Sort Intro
81 Insertion Sort Code
82 Insertion Sort Big O

Algorithms Merge Sort
83 Merge Sort Overview
84 Merge Intro
85 Merge Code
86 Merge Sort Intro
87 Merge Sort Code
88 Merge Sort Big O

Algorithms Quick Sort
89 Quick Sort Intro
90 Pivot Intro
91 Pivot Code
92 Quick Sort Code
93 Quick Sort Big O

Algorithms Tree Traversal
94 Tree Traversal Intro
95 BFS (Breadth First Search) Intro
96 BFS Code
97 DFS (Depth First Search) PreOrder – Intro
98 DFS PreOrder – Code
99 DFS PostOrder – Intro
100 DFS PostOrder – Code
101 DFS InOrder – Intro
102 DFS InOrder – Code

Coding Exercises
103 Thank You!

Homepage