Mô tả

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.

Don't just take my word for it - see for yourself with the  Free Sample Videos that I have made available.

And you'll never be left on your own, as I'll be there to answer any questions and support you every step of the way.

Enroll now and take your coding skills to the next level with Data Structures & Algorithms in C++!


_____________________________


What you will get in this course…


Over 100 hand-crafted animated HD videos to illustrate the Data Structures & Algorithms.


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



Discover the positive experiences of my previous students:

  • 5-Star Review:
    "In order to describe this course accurately, we need the definition of the word Beautiful. beau·ti·ful: adjective 1.- pleasing the senses or mind aesthetically. 2.- of a very high standard; excellent."  - Josue Hernandez Amezcua

  • 5-Star Review:
    "The best course on DSA on Udemy" - Enlai Li

  • 5-Star Review:
    "One of the best courses on DSA. The animations do make a huge impact. All the points are explained in detail. The only problem is that I can't give it more than a 5-star rating." - Nikita Sarkar

  • 5-Star Review:
    "Amazing Course. My words cannot describe how much animations helped me to understand the concepts. 100% Recommended." - Simarjeet Singh

  • 5-Star Review:
    Being a visual learner this is BY FAR the BEST course ever. The way the instructor presents this topic makes it so easy to understand." - Eduardo SN

  • 5-Star Review:
    "The animations were really helpful for an easy understanding, but the best thing about this course for me is that it will not waste your time! It is perfectly optimized, covers the important topics that I wanted, and at the same time perfectly clear. Thank you so much." - Fatemeh Moghaddam

  • 5-Star Review:
    "This course is very well done! ... the animations in each video take the explanation and understanding of the material to a new level." - Luis Felipe Posada

  • 5-Star Review:
    "This course has seriously been amazing. The animations have worked wonders for my understanding and I have made significant progress from the beginning of the course until now." - Dakota Fabro

  • 5-Star Review:
    "I can follow as a beginner, amazing." - Sabrina Fung

  • 5-Star Review:
    "This is the best course I have ever seen" - Luong Viet Tri


REMEMBER… I'm so confident that you'll love this course that we're offering a FULL money-back guarantee for 30 days! So it's a complete no-brainer, sign up today with ZERO risk and EVERYTHING to gain.

Don't miss out on this opportunity to become a coding expert!

Click the "Enroll Now" button and join thousands of successful students.  I can't wait to see what you'll achieve!

I look forward to seeing you in the course.

Now let's get started! :-)


Bạn sẽ học được gì

<> 86 Coding Exercises with Detailed Explanations

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

Yêu cầu

  • Basic programming
  • No experience with data structures or algorithms required

Nội dung khoá học

38 sections

Introduction

2 lectures
Introduction
03:26
Overview (Please Watch)
06:16

Code Editor

5 lectures
VS Code Installation
05:00
Windows - Compiler Install
09:16
Linux - Compiler Install
02:53
Mac - Compiler Install
03:18
Additional Configuration
03:29

Big O

12 lectures
Big O: Intro
02:55
Big O: Worst Case
01:36
Big O: O(n)
01:55
Big O: Drop Constants
02:16
Big O: O(n^2)
03:09
Big O: Drop Non-Dominants
02:04
Big O: O(1)
01:35
Big O: O(log n)
04:11
Big O: Different Terms for Inputs
02:09
Big O: Vectors
04:50
Big O: Wrap Up
06:47
Big O
5 questions

Pointers & Classes

2 lectures
Pointers
06:22
Classes
06:32

Linked Lists

19 lectures
Linked List: Intro
02:23
LL: Big O
07:15
LL: Under the Hood
02:15
LL: Constructor
08:08
Coding Exercises (Important)
00:05
LL: Print List
04:39
LL: Destructor
04:49
LL: Append
03:53
LL: Delete Last (Intro)
04:21
LL: Delete Last (Code)
06:56
LL: Delete Last (Rewrite)
02:09
LL: Prepend
03:02
LL: Delete First
03:12
LL: Get
03:07
LL: Set
03:14
LL: Insert
04:59
LL: Delete Node
05:49
LL: Reverse
05:41
Linked List Big O
3 questions

<> LL: Coding Exercises

10 lectures
LL: Constructor
1 question
LL: Append
1 question
LL: Delete Last
1 question
LL: Prepend
1 question
LL: Delete First
1 question
LL: Get
1 question
LL: Set
1 question
LL: Insert
1 question
LL: Delete Node
1 question
LL: Reverse
1 question

<> LL: Interview / Leetcode Exercises

8 lectures
Introduction to Interview Questions (DO NOT SKIP)
00:55
LL: Find Middle Node ( ** Interview Question)
1 question
LL: Has Loop ( ** Interview Question)
1 question
LL: Find Kth Node From End ( ** Interview Question)
1 question
LL: Partition List ( ** Interview Question)
1 question
LL: Remove Duplicates ( ** Interview Question)
1 question
LL: Binary to Decimal ( ** Interview Question)
1 question
LL: Reverse Between ( ** Interview Question)
1 question

Doubly Linked Lists

9 lectures
DLL: Constructor
04:37
DLL: Append
03:50
DLL: Delete Last
04:37
DLL: Prepend
03:04
DLL: Delete First
03:19
DLL: Get
05:23
DLL: Set
03:14
DLL: Insert
04:47
DLL: Delete Node
04:12

<> DLL: Coding Exercises

9 lectures
DLL: Constructor
1 question
DLL: Append
1 question
DLL: Delete Last
1 question
DLL: Prepend
1 question
DLL: Delete First
1 question
DLL: Get
1 question
DLL: Set
1 question
DLL: Insert
1 question
DLL: Delete Node
1 question

<> DLL: Interview / Leetcode Exercises

4 lectures
DLL: Swap First and Last ( ** Interview Question)
1 question
DLL: Reverse ( ** Interview Question)
1 question
DLL: Palindrome Checker ( ** Interview Question)
1 question
DLL: Swap Nodes in Pairs ( ** Interview Question)
1 question

Stacks & Queues

9 lectures
Stack: Intro
04:59
Stack: Constructor
03:17
Stack: Push
03:44
Stack: Pop
03:58
Queue: Intro
02:27
Queue: Constructor
03:04
Queue: Enqueue
02:40
Queue: Dequeue
03:02
Stacks & Queues Big O
3 questions

<> S&Q: Coding Exercises

6 lectures
Stack: Constructor
1 question
Stack: Push
1 question
Stack: Pop
1 question
Queue: Constructor
1 question
Queue: Enqueue
1 question
Queue: Dequeue
1 question

<> S&Q: Interview / Leetcode Exercises

7 lectures
Stack: Push for a Stack That Uses a Vector ( ** Interview Question)
1 question
Stack: Pop for a Stack That Uses a Vector ( ** Interview Question)
1 question
Stack: Reverse String ( ** Interview Question)
1 question
Stack: Parentheses Balanced ( ** Interview Question)
1 question
Stack: Sort Stack ( ** Interview Question)
1 question
Queue Using Stacks: Enqueue ( ** Interview Question) NEW
1 question
Queue Using Stacks: Dequeue ( ** Interview Question) NEW
1 question

Trees

9 lectures
Trees: Intro & Terminology
04:43
Binary Search Trees: Example
02:33
BST: Big O
08:11
BST: Constructor
04:51
BST: Insert - Intro
05:27
BST: Insert - Code
08:59
BST: Contains - Intro
03:01
BST: Contains - Code
07:34
BST Big O
3 questions

<> BST: Coding Exercises

3 lectures
BST: Constructor
1 question
BST: Insert
1 question
BST: Contains
1 question

Hash Tables

10 lectures
Hash Table: Intro
04:40
HT: Collisions
01:38
HT: Constructor
04:13
HT: Hash Function
03:15
HT: Set
03:58
HT: Get
05:09
HT: Keys
03:15
HT: Big O
03:04
HT: Interview Question
07:09
Hash Table Big O
3 questions

<> HT: Coding Exercises

4 lectures
HT: Constructor
1 question
HT: Set
1 question
HT: Get
1 question
HT: Keys
1 question

<> HT: Interview / Leetcode Exercises

11 lectures
HT: Item In Common ( ** Interview Question)
1 question
HT: Find Duplicates ( ** Interview Question)
1 question
HT: First Non-Repeating Character ( ** Interview Question)
1 question
HT: Group Anagrams ( ** Interview Question)
1 question
HT: Two Sum ( ** Interview Question)
1 question
HT: Subarray Sum ( ** Interview Question)
1 question
Introduction to Sets
00:47
Set: Remove Duplicates ( ** Interview Question)
1 question
Set: Has Unique Chars ( ** Interview Question)
1 question
Set: Find Pairs ( ** Interview Question)
1 question
Set: Longest Consecutive Sequence ( ** Interview Question)
1 question

Graphs

10 lectures
Graph: Intro
03:45
Graph: Adjacency Matrix
02:58
Graph: Adjacency List
01:19
Graph: Unordered Sets
01:21
Graph: Big O
05:37
Graph: Add Vertex
04:08
Graph: Add Edge
02:43
Graph: Remove Edge
02:44
Graph: Remove Vertex
05:39
Graph Big O
3 questions

<> Graph: Coding Exercises

4 lectures
Graph: Add Vertex
1 question
Graph: Add Edge
1 question
Graph: Remove Edge
1 question
Graph: Remove Vertex
1 question

Heaps

7 lectures
Heap: Intro
06:03
Heap: Insert (Intro)
04:41
Heap: Helper Functions
02:59
Heap: Insert (Code)
05:55
Heap: Remove
05:13
Heap: Sink Down
09:08
Heap: Priority Queues & Big O
03:37

<> Heap: Coding Exercises

6 lectures
Heap: Insert
1 question
Heap: Remove
1 question
Heap: Sink Down
1 question
Heap: MinHeap Insert
1 question
Heap: MinHeap Remove
1 question
Heap: MinHeap Sink Down
1 question

Recursion

3 lectures
Recursion: Intro
06:17
Call Stack
06:51
Factorial
09:45

Recursive Binary Search Trees

7 lectures
rBST: Contains
08:02
rBST: Insert
07:47
rBST: Delete Intro
02:20
rBST: Delete Code (1 of 3)
06:05
rBST: Delete Code (2 of 3)
06:18
rBST: Minimum Value
04:18
rBST: Delete Code (3 of 3)
05:09

<> rBST: Coding Exercises

4 lectures
rBST: Contains
1 question
rBST: Insert
1 question
BST: Minimum Value
1 question
rBST: Delete
1 question

Tree Traversal

9 lectures
Tree Traversal: Intro
01:37
BFS (Breadth First Search): Intro
02:32
BFS: Code
05:25
DFS (Depth First Search): PreOrder - Intro
01:29
DFS: PreOrder - Code
05:52
DFS: PostOrder - Intro
01:47
DFS: PostOrder - Code
04:38
DFS: InOrder - Intro
01:56
DFS: InOrder - Code
04:26

<> BST Traversal: Coding Exercises

4 lectures
BST: Breadth First Search (BFS)
1 question
BST: DFS PreOrder
1 question
BST: DFS PostOrder
1 question
BST: DFS InOrder
1 question

Basic Sorts

8 lectures
Bubble Sort: Intro
02:36
Bubble Sort: Code
05:00
Selection Sort: Intro
03:38
Selection Sort: Code
05:30
Insertion Sort: Intro
01:43
Insertion Sort: Code
04:53
Insertion Sort: Big O
01:20
Basic Sorts
3 questions

<> Basic Sorts: Coding Exercises

3 lectures
Bubble Sort
1 question
Selection Sort
1 question
Insertion Sort
1 question

<> Basic Sorts: Interview / LeetCode Exercises

3 lectures
Bubble Sort of LL ( ** Interview Question)
1 question
Selection Sort of LL ( ** Interview Question)
1 question
Insertion Sort of LL ( ** Interview Question)
1 question

Merge Sort

8 lectures
Merge Sort: Overview
01:36
Merge: Intro (1)
01:34
Merge: Intro (2)
01:38
Merge: Code (1)
04:00
Merge: Code (2)
05:54
Merge Sort: Intro
02:25
Merge Sort: Code
09:43
Merge Sort: Big O
03:55

<> Merge Sort: Coding Exercises

2 lectures
Merge
1 question
Merge Sort
1 question

<> Merge: Interview / LeetCode Exercise

1 lectures
Merge Two Sorted LL ( ** Interview Question)
1 question

Quick Sort

5 lectures
Quick Sort: Intro
02:43
Pivot: Intro
03:30
Pivot: Code
04:51
Quick Sort: Code
09:28
Quick Sort: Big O
02:59

<> Quick Sort: Coding Exercises

2 lectures
Pivot
1 question
Quick Sort
1 question

Dynamic Programming

5 lectures
Overlapping Subproblems
04:51
Optimized Substructure
03:27
Fibonacci Sequence
10:04
Memoization
13:47
Bottom Up
06:17

<> Vector: Interview / LeetCode Exercises

7 lectures
Vector: Remove Element ( ** Interview Question)
1 question
Vector: Find Max Min ( ** Interview Question)
1 question
Vector: Find Longest String ( ** Interview Question)
1 question
Vector: Remove Duplicates ( ** Interview Question)
1 question
Vector: Max Profit ( ** Interview Question)
1 question
Vector: Rotate ( ** Interview Question)
1 question
Vector: Max Sub Array ( ** Interview Question)
1 question

Coding Exercises

1 lectures
Coding Exercises Are Now After Each Section - (CLICK HERE FOR MORE INFO)
00:09

Đánh giá của học viên

Chưa có đánh giá
Course Rating
5
0%
4
0%
3
0%
2
0%
1
0%

Bình luận khách hàng

Viết Bình Luận

Bạn đánh giá khoá học này thế nào?

image

Đăng ký get khoá học Udemy - Unica - Gitiho giá chỉ 50k!

Get khoá học giá rẻ ngay trước khi bị fix.