Data structures playlist
Master Data Structures: From Basics to Advanced Techniques with William Fiset! Unlock the power of algorithms through hands-on coding and in-depth explanations. Elevate your programming skills and conquer complex challenges with ease!
5.0
(2)
21 learners
What you'll learn
- Recognize and differentiate between various data structures and their uses.
- Implement abstract data types, including stacks and queues, using code.
- Evaluate algorithms using Big-O notation to determine their efficiency.
- Develop and apply hash table techniques such as separate chaining and open addressing.
This course includes
- 8.5 hours of video
- Certificate of completion
- Access on mobile and TV
Course content
1 modules • 55 lessons • 8.5 hours of video
Comprehensive Guide to Data Structures and Algorithms
55 lessons
• 8.5 hours
Comprehensive Guide to Data Structures and Algorithms
55 lessons
• 8.5 hours
- Data structures introduction 02:24
- Abstract data types 04:48
- Introduction to Big-O 12:40
- Dynamic and Static Arrays 11:52
- Dynamic Array Code 06:46
- Linked Lists Introduction 14:43
- Doubly Linked List Code 09:36
- Stack Introduction 11:39
- Stack Implementation 03:32
- Stack Code 03:32
- Queue Introduction 06:26
- Queue Implementation 05:50
- Queue Code 04:14
- Priority Queue Introduction 13:18
- Priority Queue Min Heaps and Max Heaps 06:15
- Priority Queue Inserting Elements 09:59
- Priority Queue Removing Elements 14:07
- Priority Queue Code 15:50
- Union Find Introduction 05:46
- Union Find Kruskal's Algorithm 06:15
- Union Find - Union and Find Operations 10:53
- Union Find Path Compression 06:36
- Union Find Code 07:41
- Binary Search Tree Introduction 12:31
- Binary Search Tree Insertion 05:53
- Binary Search Tree Removal 14:10
- Binary Search Tree Traversals 11:58
- Binary Search Tree Code 13:20
- Hash table hash function 17:21
- Hash table separate chaining 08:14
- Hash table separate chaining source code 11:47
- Hash table open addressing 11:09
- Hash table linear probing 13:56
- Hash table quadratic probing 09:27
- Hash table double hashing 14:50
- Hash Table Open Addressing Removals 07:33
- Hash table open addressing code 14:42
- Fenwick Tree range queries 13:45
- Fenwick Tree point updates 04:36
- Fenwick Tree construction 06:29
- Fenwick tree source code 05:42
- Suffix array introduction 03:16
- Longest Common Prefix (LCP) array 03:30
- Suffix array finding unique substrings 04:39
- Longest common substring problem suffix array 11:30
- Longest common substring problem suffix array part 2 06:47
- Longest Repeated Substring suffix array 04:38
- Balanced binary search tree rotations 08:51
- AVL tree insertion 09:36
- AVL tree removals 08:56
- AVL tree source code 16:49
- Indexed Priority Queue (UPDATED) | Data Structures 25:22
- Indexed Priority Queue | Data Structure | Source Code 08:34
- Sparse Table Data Structure 23:18
- Sparse Table Data Structure | Source Code 07:16
Related learning topics
Take this course with you
Download the app to continue lessons from your phone anytime.
