English | MP4 | AVC 1280×720 | AAC 44KHz 2ch | 6h 42m | 2.16 GB
20 hours of content in 6 1/2 hours. Prepare for your Coding Interview in a fraction of the time with animated examples.
This course is different…
After each line of code, an animation of the data structure or algorithm is updated to show exactly what that line of code did.
The animations provide some huge advantages to students:
- Increased understanding of the concepts
- Greater rate of retention
- The material can be covered in a fraction of the time
That means that you can actually learn more material in less time and have higher retention of the material.
That is the key combination of factors to prepare you for the technical interview that lands you your dream job!
I invite you to watch a few of the videos in this course to see what I mean. The difference will be noticeable right away!
I spent over a year to create this course with the goal that an absolute beginner can take it and understand all of the concepts the first time through.
What you will get in this course…
100 hand crafted HD videos that use animations to illustrate technical concepts.
Here is what you will learn in this course:
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
I am excited to help you move forward with your coding and career goals.
Let’s get started!
What you’ll learn
- 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 Code Editor
Big O
3 Big O Intro
4 Big O Worst Case
5 Big O O(n)
6 Big O Drop Constants
7 Big O O(n^2)
8 Big O Drop Non-Dominants
9 Big O O(1)
10 Big O O(log n)
11 Big O Different Terms for Input
12 Big O Arrays
13 Big O Wrap Up
14 Quiz Intro
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 LL Push
22 LL Pop – Intro
23 LL Pop – Code
24 LL Unshift
25 LL Shift
26 LL Get
27 LL Set
28 LL Insert
29 LL Remove
30 LL Reverse
Data Structures Doubly Linked Lists
31 DLL Constructor
32 DLL Push
33 DLL Pop
34 DLL Unshift
35 DLL Shift
36 DLL Get
37 DLL Set
38 DLL Insert
39 DLL Remove
Data Structures Stacks & Queues
40 Stack Intro
41 Stack Constructor
42 Stack Push
43 Stack Pop
44 Queue Intro
45 Queue Constructor
46 Queue Enqueue
47 Queue Dequeue
Data Structures Trees
48 Trees Intro & Terminology
49 Binary Search Trees Example
50 BST Big O
51 BST Constructor
52 BST Insert – Intro
53 BST Insert – Code
54 BST Contains
Data Structures Hash Tables
55 Hash Table Intro
56 HT Collisions
57 HT Constructor
58 HT Set
59 HT Get
60 HT Keys
61 HT Big O
62 HT Interview Question
Data Structures Graphs
63 Graph Intro
64 Graph Adjacency Matrix
65 Graph Adjacency List
66 Graph Big O
67 Graph Add Vertex
68 Graph Add Edge
69 Graph Remove Edge
70 Graph Remove Vertex
Algorithms Recursion
71 Recursion Intro
72 Call Stack
73 Factorial
Algorithms Basic Sorts
74 Bubble Sort Intro
75 Bubble Sort Code
76 Selection Sort Intro
77 Selection Sort Code
78 Insertion Sort Intro
79 Insertion Sort Code
80 Insertion Sort Big O
Algorithms Merge Sort
81 Merge Sort Overview
82 Merge Intro
83 Merge Code
84 Merge Sort Intro
85 Merge Sort Code
86 Merge Sort Big O
Algorithms Quick Sort
87 Quick Sort Intro
88 Pivot Intro
89 Pivot Code
90 Quick Sort Code
91 Quick Sort Big O
Algorithms Tree Traversal
92 Tree Traversal Intro
93 BFS (Breadth First Search) Intro
94 BFS Code
95 DFS (Depth First Search) PreOrder – Intro
96 DFS PreOrder – Code
97 DFS PostOrder – Intro
98 DFS PostOrder – Code
99 DFS InOrder – Intro
100 DFS InOrder – Code
Resolve the captcha to access the links!