English | MP4 | AVC 1280×720 | AAC 44KHz 2ch | 107 lectures (7h 27m) | 2.44 GB
The Ultimate C++ Coding Interview & Computer Science Bootcamp
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…
Over 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
- Lists
- 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.
What you’ll learn
- Mastery of Data Structures and Algorithms
- Time and Space Complexity of Data Structures and Algorithms
- Strengthen Your Skills as a Developer
- Confidently Answer Technical Interview Questions
Table of Contents
Introduction
1 Introduction
Code Editor
2 VS Code Installation
3 Windows – Compiler Install
4 Linux – Compiler Install
5 Mac – Compiler Install
6 Additional Configuration
Big O
7 Big O Intro
8 Big O Worst Case
9 Big O O(n)
10 Big O Drop Constants
11 Big O O(n^2)
12 Big O Drop Non-Dominants
13 Big O O(1)
14 Big O O(log n)
15 Big O Different Terms for Inputs
16 Big O Vectors
17 Big O Wrap Up
Pointers & Classes
18 Pointers
19 Classes
Data Structures Linked Lists
20 Linked List Intro
21 LL Big O
22 LL Under the Hood
23 LL Constructor
24 LL Print List
25 LL Append
26 LL Remove Last (Intro)
27 LL Remove Last (Code)
28 LL Prepend
29 LL Remove First
30 LL Get
31 LL Set
32 LL Insert
33 LL Remove
34 LL Reverse
Data Structures Doubly Linked Lists
35 DLL Constructor
36 DLL Append
37 DLL Remove Last
38 DLL Prepend
39 DLL Remove First
40 DLL Get
41 DLL Set
42 DLL Insert
43 DLL Remove
Data Structures Stacks & Queues
44 Stack Intro
45 Stack Constructor
46 Stack Push
47 Stack Pop
48 Queue Intro
49 Queue Constructor
50 Queue Enqueue
51 Queue Dequeue
Data Structures Trees
52 Trees Intro & Terminology
53 Binary Search Trees Example
54 BST Big O
55 BST Constructor
56 BST Insert – Intro
57 BST Insert – Code
58 BST Contains – Intro
59 BST Contains – Code
Data Structures Hash Tables
60 Hash Table Intro
61 HT Collisions
62 HT Constructor
63 HT Hash Function
64 HT Set
65 HT Get
66 HT Keys
67 HT Big O
68 HT Interview Question
Data Structures Graphs
69 Graph Intro
70 Graph Adjacency Matrix
71 Graph Adjacency List
72 Graph Unordered Sets
73 Graph Big O
74 Graph Add Vertex
75 Graph Add Edge
76 Graph Remove Edge
77 Graph Remove Vertex
Algorithms Recursion
78 Recursion Intro
79 Call Stack
80 Factorial
Algorithms Basic Sorts
81 Bubble Sort Intro
82 Bubble Sort Code
83 Selection Sort Intro
84 Selection Sort Code
85 Insertion Sort Intro
86 Insertion Sort Code
87 Insertion Sort Big O
Algorithms Merge Sort
88 Merge Sort Overview
89 Merge Intro (1)
90 Merge Intro (2)
91 Merge Code (1)
92 Merge Code (2)
93 Merge Sort Intro
94 Merge Sort Code
95 Merge Sort Big O
Algorithms Quick Sort
96 Quick Sort Intro
97 Pivot Intro
98 Pivot Code
99 Quick Sort Code
100 Quick Sort Big O
Algorithms Tree Traversal
101 Tree Traversal Intro
102 BFS (Breadth First Search) Intro
103 BFS Code
104 DFS (Depth First Search) PreOrder – Intro
105 DFS PreOrder – Code
106 DFS PostOrder – Intro
107 DFS PostOrder – Code
Resolve the captcha to access the links!