Data Structures And Algorithms | Full Animated Course (Updated)

ByteQuest · Beginner ·⚡ Algorithms & Data Structures ·1y ago

About this lesson

This video offers a comprehensive collection of animated lessons on Data Structures and Algorithms, presented in a unique and intuitive way that makes the concepts easier to grasp compared to traditional blackboard-style teaching. Most of the data structures in the video are implemented in Python, and the animations are also created using Python. The video on arrays and sorting Algorithms features my own voice, while the rest of the videos use TTS (Text-to-Speech) models. THIS VIDEO IS A MERGE OF THE 1.5-YEAR PROJECT I'VE WORKED ON. GitHub link for both:- https://github.com/ByteQuest0 Do connect on GitHub. All the individual videos are in this playlist:-https://www.youtube.com/playlist?list=PLVHz9YUo4rRdHQuCINOa1NXRfRduBzSNF Tools used to make this video:- Adobe Premiere Pro for video editing, Manim Library (by 3b1b) for making the animations, Text-To-Speech Models for voice generation. Background Musics used:- Sovereign by Kevin MacLeod | https://incompetech.com/ Music promoted by https://www.chosic.com/free-music/all/ Creative Commons CC BY 3.0 https://creativecommons.org/licenses/by/3.0/ Chapters 0:00:00 Introduction 0:00:38 Arrays 0:10:20 Linked Lists 0:28:52 Stacks 0:35:38 Queues 0:50:05 Binary Search Trees 1:23:02 AVL Trees 1:36:36 Red-Black Trees 2:02:18 Heaps 2:14:23 Heap Sort 2:26:45 Hash Tables 2:22:47 Introduction to Graphs 2:38:45 Depth First Search 2:46:30 Breadth First Search 2:51:42 Prim's Algorithm 2:55:20 Kruskal's Algorithm 3:03:57 Dijkstra's Algorithm 3:16:13 Bellman-Ford Algorithm 3:32:08 Floyd-Warshall Algorithm 3:40:41 Master Theorem 3:48:03 Sorting Algorithm 4:04:16 Knuth-Morris-Pratt Algorithm 4:11:30 Rabin-Karp Algorithm

Original Description

This video offers a comprehensive collection of animated lessons on Data Structures and Algorithms, presented in a unique and intuitive way that makes the concepts easier to grasp compared to traditional blackboard-style teaching. Most of the data structures in the video are implemented in Python, and the animations are also created using Python. The video on arrays and sorting Algorithms features my own voice, while the rest of the videos use TTS (Text-to-Speech) models. THIS VIDEO IS A MERGE OF THE 1.5-YEAR PROJECT I'VE WORKED ON. GitHub link for both:- https://github.com/ByteQuest0 Do connect on GitHub. All the individual videos are in this playlist:-https://www.youtube.com/playlist?list=PLVHz9YUo4rRdHQuCINOa1NXRfRduBzSNF Tools used to make this video:- Adobe Premiere Pro for video editing, Manim Library (by 3b1b) for making the animations, Text-To-Speech Models for voice generation. Background Musics used:- Sovereign by Kevin MacLeod | https://incompetech.com/ Music promoted by https://www.chosic.com/free-music/all/ Creative Commons CC BY 3.0 https://creativecommons.org/licenses/by/3.0/ Chapters 0:00:00 Introduction 0:00:38 Arrays 0:10:20 Linked Lists 0:28:52 Stacks 0:35:38 Queues 0:50:05 Binary Search Trees 1:23:02 AVL Trees 1:36:36 Red-Black Trees 2:02:18 Heaps 2:14:23 Heap Sort 2:26:45 Hash Tables 2:22:47 Introduction to Graphs 2:38:45 Depth First Search 2:46:30 Breadth First Search 2:51:42 Prim's Algorithm 2:55:20 Kruskal's Algorithm 3:03:57 Dijkstra's Algorithm 3:16:13 Bellman-Ford Algorithm 3:32:08 Floyd-Warshall Algorithm 3:40:41 Master Theorem 3:48:03 Sorting Algorithm 4:04:16 Knuth-Morris-Pratt Algorithm 4:11:30 Rabin-Karp Algorithm

Watch on YouTube ↗ (saves to browser)

Sign in to unlock AI tutor explanation · ⚡30

Related Reads

O(N) Manacher's Algorithm with Mirror Boundary Optimization

Learn to optimize palindrome detection using Manacher's Algorithm with mirror boundary optimization, reducing time complexity to O(N)

Dev.to · Dipaditya Das

Building a Power Grid Inside Minecraft with BFS Algorithms

Learn to build a power grid inside Minecraft using BFS algorithms and understand its relevance to cloud services

Dev.to · Carlos Cortez 🇵🇪 [AWS Hero]

The Run-Length Encoding Trick: How Simple Strings Get Compressed

Learn how Run-Length Encoding (RLE) compresses simple strings, a fundamental technique in programming and data compression, and apply it to optimize storage and transmission of data

Medium · Programming

75 Days of Leetcode — Day 4: #238 — Product of Array Except Self

Solve the Product of Array Except Self problem on LeetCode to improve coding skills and learn array manipulation techniques

Chapters (23)

Introduction

0:38 Arrays

10:20 Linked Lists

28:52 Stacks

35:38 Queues

50:05 Binary Search Trees

1:23:02 AVL Trees

1:36:36 Red-Black Trees

2:02:18 Heaps

2:14:23 Heap Sort

2:26:45 Hash Tables

2:22:47 Introduction to Graphs

2:38:45 Depth First Search

2:46:30 Breadth First Search

2:51:42 Prim's Algorithm

2:55:20 Kruskal's Algorithm

3:03:57 Dijkstra's Algorithm

3:16:13 Bellman-Ford Algorithm

3:32:08 Floyd-Warshall Algorithm

3:40:41 Master Theorem

3:48:03 Sorting Algorithm

4:04:16 Knuth-Morris-Pratt Algorithm

4:11:30 Rabin-Karp Algorithm

Stump Grinder Carbide Wheel Grinds Hardwood To Chips

Innoforge Studio