Course Hive
Courses
Summaries
Continue with Google
or

Comprehensive Guide to Data Structures and Algorithms

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!

4.0 (4)
33 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
  • Data structures introduction02:24
  • Abstract data types04:47
  • Introduction to Big-O12:40
  • Dynamic and Static Arrays11:51
  • Dynamic Array Code06:45
  • Linked Lists Introduction14:43
  • Doubly Linked List Code09:35
  • Stack Introduction11:39
  • Stack Implementation03:32
  • Stack Code03:31
  • Queue Introduction06:26
  • Queue Implementation05:50
  • Queue Code04:13
  • Priority Queue Introduction13:18
  • Priority Queue Min Heaps and Max Heaps06:15
  • Priority Queue Inserting Elements09:58
  • Priority Queue Removing Elements14:07
  • Priority Queue Code15:50
  • Union Find Introduction05:46
  • Union Find Kruskal's Algorithm06:14
  • Union Find - Union and Find Operations10:53
  • Union Find Path Compression06:35
  • Union Find Code07:40
  • Binary Search Tree Introduction12:31
  • Binary Search Tree Insertion05:53
  • Binary Search Tree Removal14:09
  • Binary Search Tree Traversals11:57
  • Binary Search Tree Code13:19
  • Hash table hash function17:20
  • Hash table separate chaining08:14
  • Hash table separate chaining source code11:47
  • Hash table open addressing11:09
  • Hash table linear probing13:55
  • Hash table quadratic probing09:26
  • Hash table double hashing14:49
  • Hash Table Open Addressing Removals07:33
  • Hash table open addressing code14:41
  • Fenwick Tree range queries13:44
  • Fenwick Tree point updates04:35
  • Fenwick Tree construction06:29
  • Fenwick tree source code05:42
  • Suffix array introduction03:15
  • Longest Common Prefix (LCP) array03:29
  • Suffix array finding unique substrings04:39
  • Longest common substring problem suffix array11:29
  • Longest common substring problem suffix array part 206:47
  • Longest Repeated Substring suffix array04:37
  • Balanced binary search tree rotations08:51
  • AVL tree insertion09:36
  • AVL tree removals08:56
  • AVL tree source code16:49
  • Indexed Priority Queue (UPDATED) | Data Structures25:21
  • Indexed Priority Queue | Data Structure | Source Code08:33
  • Sparse Table Data Structure23:18
  • Sparse Table Data Structure | Source Code07:16

You may also be interested in

FAQs

Suggest a Youtube Course

Our catalog is built based on the recommendations and interests of students like you.

Course Hive
Download now and unlock unlimited audiobooks — 100% free
Explore Now