The Last Algorithms Course You'll Want (Part 2)

The Last Algorithms Course You'll Want (Part 2)

Learning Paths:
3 hours, 10 minutes CC

Advance your algorithmic skills with an in-depth exploration of essential data structures and algorithms. Delve into binary and M-Way search trees, AVL and red-black trees, understanding their insertions, deletions, and balancing mechanisms. Master graph theory, from basic concepts to complex traversals like breadth-first and depth-first searches, and algorithms including Prim's and Kruskal's. Learn dynamic programming with real-world examples like factorial, Fibonacci, and the coin change problem. The course concludes with practical applications of Bloom Filters, offering insights into efficient data handling and optimization techniques.

This course and others like it are available as part of our Frontend Masters video subscription.

Published: January 22, 2024
Get Unlimited Access Now
Table of Contents

Introduction

Binary Search Trees

AVL & Red-Black Trees

M-Way & B-Trees

Graphs

Dynamic Programming

Wrapping Up