Mosh Hamedani – The Ultimate Data Structures & Algorithms: Part 2

*** Proof of Product ***

---

Exploring the Essential Features of “Mosh Hamedani – The Ultimate Data Structures & Algorithms: Part 2”

Ultimate Data Structures & Algorithms: Part 2
Ace your coding job interview. Learn to write better and faster code.

COURSE OVERVIEW

• Intermediate
• 6 hours of HD video
• 130 lessons
• Downloadable content
• Hands-on exercises
• English captions

Clear. Concise. Comprehensive.
Tired of piecing together disconnected tutorials or dealing with rambling, confusing instructors? This course is for you! It’s perfectly structured into a series of bite-sized, easy-to-follow videos that cover both theory and practice.

What You’ll Learn

• Binary Trees: Understand binary tree structure, traversal algorithms, and applications
• AVL Trees: Explore balanced binary search trees like AVL trees for efficient searching and insertion
• Heaps: Study min heaps and max heaps, including heapify operations and heap sort algorithm
• Tries: Delve into trie data structures for efficient word/key searching and storage 
• Graphs: Learn about directed and undirected graphs, BFS, DFS, and other graph algorithm

Course Content
6 Hours . 7 Sections . 130 Lessons

Getting Started (50s)
Introduction 0m 50s
Source Code
Follow Me Around
Learning Paths

Binary Trees (1h)
Introduction
What are Trees
Exercise- Populating a Binary Search Tree
Exercise- Building a Tree
Solution- insert
Solution- find
Traversing Trees 5m 58s
Exercise- Tree Traversal
Recursion 5m 39s
Depth First Traversals 5m 23s
Depth and Height of Nodes 7m 06s
Minimum Value in a Tree 7m 37s
Exercise- Equality Checking 0m 45s
Solution- Equality Checking 4m 08s
Exercise- Validating Binary Search Trees 4m 14s
Solution- Validating Binary Search Trees 4m 18s
Exercise- Nodes at K Distance 1m 48s
Solution- Nodes at K Distance from the Root 4m 37s
Level Order Traversal 2m 55s
Trees- Exercises
Summary 1m 22s

AVL Trees (50m)
Introduction 0m 31s
Balanced and Unbalanced Trees 3m 01s
Rotations 5m 02s
AVL Trees 4m 04s
Exercise: AVL Rotations
Exercise- Building an AVL Tree 1m 11s
Solution- insert 8m 47s
Exercise- Height Calculation 1m 24s
Solution- Height Calculation 2m 43s
Exercise- Balance Factor 2m 04s
Solution- Balance Factor 4m 01s
Exercise- Detecting Rotations 2m 54s
Solution- Detecting Rotations 3m 32s
Exercise- Implementing Rotations 3m 51s
Solution- Implementing Rotations 5m 40s
AVL Trees- Exercises
Summary 1m 01s
A Quick Note

Heaps (55m)
Introduction 0m 21s
What are Heaps 6m 28s
Exercise- Working with Heaps
Exercise- Building a Heap 1m 55s
Solution- insert 8m 24s
Solution- remove 7m 07s
Solution – Edge Cases 6m 11s
Heap Sort 2m 29s
Priority Queues 5m 04s
Exercise- Heapify 1m 26s
Solution- Heapify 7m 12s
Solution- Optimization 2m 42s
Exercise- Kth Largest Item 0m 31s
Solution- Kth Largest Item 3m 47s
Heaps- Exercises
Summary 1m 19s

Tries (47m)
Introduction 0m 30s
What are Tries 3m 50s
Exercise- Populating a Trie
Exercise- Building a Trie 3m 03s
Solution- Building a Trie 5m 44s
An Implementation with a HashTable 1m 50s
A Better Abstraction 5m 28s
Exercise- Looking Up a Word 1m 12s
Solution- Looking Up a Word 2m 35s
Traversals 3m 35s
Exercise- Removing a Word 1m 53s
Solution- Removing a Word 8m 14s
Exercise- Auto Completion 2m 51s
Solution- Auto Completion 5m 59s
Tries- Exercises
Summary 0m 45s
A Quick Note

Graphs(1h)
Introduction 0m 26s
What are Graphs 2m 09s
Adjacency Matrix 4m 14s
Adjacency List 6m 32s
Exercise- Building a Graph 1m 50s
Solution- Adding Nodes and Edges 7m 34s
Solution- Removing Nodes and Edges 4m 48s
Traversal Algorithms 3m 58s
Exercise- Traversal Algorithms
Exercise- Depth-first Traversal 1m 29s
Solution- Depth-first Traversal 3m 44s
Exercise- Depth-first Traversal 2m 44s
Solution- Depth-first Traversal 3m 59s
Exercise- Breadth-first Traversal 1m 18s
Solution- Breadth-first Traversal 2m 41s
Exercise- Topological Sorting 5m 06s
Solution- Topological Sort 4m 05s
Exercise- Cycle Detection 3m 42s
Solution- Cycle Detection 6m 26s
Graphs Summary 1m 02s

Undirected Graphs (1h)
Introduction 0m 26s
Exercise- Weighted Graphs 1m 30s
Solution- Weighted Graphs 5m 20s
An Object-oriented Solution 6m 13s
Dijkstra’s Shortest Path Algorithm 4m 35s
Exercise- Getting the Shortest Distance 6m 08s
Solution- The Shortest Distance 5m 27s
Solution- Shortest Path 7m 53s
Exercise- Cycle Detection 2m 03s
Solution- Cycle Detection 4m 42s
Minimum Spanning Tree 1m 56s
Exercise- Prim’s Algorithm 2m 45s
Solution- Prim’s Algorithm 10m 39s
Course Wrap Up 0m 30s
Thank You

Who Is This For?

• Anyone preparing for a coding job interview
• Computer science students whose lecturers failed to explain the topics
• Self-taught developers who missed out on a computer science degree
• Anyone who wants to become a better developer

Prerequisites
This course is the second part of a series. So you should have watched the first part or have a solid understanding of the concepts covered there.
Here are the courses we recommend if you need to strengthen the fundamentals.

HELLO,

I’m Mosh Hamedani.
Are you feeling stuck or overwhelmed in your coding journey? Don’t worry, I’ve got your back! Together, we’ll work to level up your skills, increase your earning potential, and build a brighter future.

Please see the full list of alternative group-buy courses available here: https://lunacourse.com/shop/