English | MP4 | AVC 1280×720 | AAC 44KHz 2ch | 114 lectures (7h 42m) | 2.54 GB
DSA for the Cracking the Coding Interview. Animated Examples for Faster Learning and Deeper Understanding.
Unlock Your Coding Potential with Data Structures & Algorithms in C++!
Say goodbye to boring and confusing lessons and hello to a dynamic, visually appealing learning experience that will transform the way you code.
My animated approach to Data Structures & Algorithms will help you quickly grasp complex concepts and retain more information, making your coding journey easier and more efficient.
With over 100 hand-crafted HD videos, you’ll receive a thorough understanding of Data Structures & Algorithms that will leave you feeling confident and prepared.
Maximize your learning and boost your coding skills by immediately putting your newfound knowledge to the test with {Coding Exercises} after each coding video.
Here are the topics we will cover:
Technical
- Big O notation
Data Structures
- Arrays
- Vectors
- 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
- 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
Introduction
Course Overview
Code Editor
VS Code Installation
Windows – Compiler Install
Linux – Compiler Install
Mac – Compiler Install
Additional Configuration
Big O
Big O Intro
Big O Worst Case
Big O O(n)
Big O Drop Constants
Big O O(n^2)
Big O Drop Non-Dominants
Big O O(1)
Big O O(log n)
Big O Different Terms for Inputs
Big O Vectors
Big O Wrap Up
Big O
Pointers & Classes
Pointers
Classes
Data Structures Linked Lists
Linked List Intro
LL Big O
LL Under the Hood
LL Constructor
Coding Exercises (Important)
LL Print List
LL Destructor
LL Append
LL Delete Last (Intro)
LL Delete Last (Code)
LL Delete Last (Rewrite)
LL Prepend
LL Delete First
LL Get
LL Set
LL Insert
LL Delete Node
LL Reverse
Linked List Big O
Data Structures Doubly Linked Lists
DLL Constructor
DLL Append
DLL Delete Last
DLL Prepend
DLL Delete First
DLL Get
DLL Set
DLL Insert
DLL Delete Node
Data Structures Stacks & Queues
Stack Intro
Stack Constructor
Stack Push
Stack Pop
Queue Intro
Queue Constructor
Queue Enqueue
Queue Dequeue
Stacks & Queues Big O
Data Structures Trees
Trees Intro & Terminology
Binary Search Trees Example
BST Big O
BST Constructor
BST Insert – Intro
BST Insert – Code
BST Contains – Intro
BST Contains – Code
BST Big O
Data Structures Hash Tables
Hash Table Intro
HT Collisions
HT Constructor
HT Hash Function
HT Set
HT Get
HT Keys
HT Big O
HT Interview Question
Hash Table Big O
Data Structures Graphs
Graph Intro
Graph Adjacency Matrix
Graph Adjacency List
Graph Unordered Sets
Graph Big O
Graph Add Vertex
Graph Add Edge
Graph Remove Edge
Graph Remove Vertex
Graph Big O
Algorithms Recursion
Recursion Intro
Call Stack
Factorial
Algorithms Basic Sorts
Bubble Sort Intro
Bubble Sort Code
Selection Sort Intro
Selection Sort Code
Insertion Sort Intro
Insertion Sort Code
Insertion Sort Big O
Basic Sorts
Algorithms Merge Sort
Merge Sort Overview
Merge Intro (1)
Merge Intro (2)
Merge Code (1)
Merge Code (2)
Merge Sort Intro
Merge Sort Code
Merge Sort Big O
Algorithms Quick Sort
Quick Sort Intro
Pivot Intro
Pivot Code
Quick Sort Code
Quick Sort Big O
Algorithms Tree Traversal
Tree Traversal Intro
BFS (Breadth First Search) Intro
BFS Code
DFS (Depth First Search) PreOrder – Intro
DFS PreOrder – Code
DFS PostOrder – Intro
DFS PostOrder – Code
DFS InOrder – Intro
DFS InOrder – Code
Coding Exercises
LL Constructor
LL Append
LL Delete Last
LL Prepend
LL Delete First
LL Get
LL Set
LL Insert
LL Delete Node
LL Reverse
DLL Constructor
DLL Append
DLL Delete Last
DLL Prepend
DLL Delete First
DLL Get
DLL Set
DLL Insert
DLL Delete Node
Stack Constructor
Stack Push
Stack Pop
Queue Constructor
Queue Enqueue
Queue Dequeue
BST Constructor
BST Insert
BST Contains
HT Constructor
HT Set
HT Get
HT Keys
Graph Add Vertex
Graph Add Edge
Graph Remove Edge
Graph Remove Vertex
Bubble Sort
Selection Sort
Insertion Sort
Merge
Merge Sort
Pivot
Quick Sort
BST Breadth First Search (BFS)
BST DFS PreOrder
BST DFS PostOrder
BST DFS InOrder
Thank You!
Resolve the captcha to access the links!