FrontendMasters - The Last Algorithms Course Youll Need

Course Details

Course Title....: The Last Algorithms Course You'll Need
Teacher.........: ThePrimeagen (terminal)
Length..........: 9 hours, 20 minutes CC
Published.......: September 12, 2022
Learning Paths..: TypeScript / Computer Science
Topics..........: typescript / computer-science / algorithms
Course URL......: https://frontendmasters.com/courses/algorithms/

Course Description

Welcome to a super fun, beginner-friendly data structures and algorithms course. Is it really the last algorithms course you'll need? If you want to pass tough interview questions, then yes! You'll learn big o time complexity, fundamental data structures like arrays, lists, trees, graphs, and maps, and searching and sorting algorithms.
This course and others like it are available as part of our Frontend Masters video subscription.

Table of Contents

Introduction (7 minutes)
- Introduction
Basics (29 minutes)
- Big O Time Complexity
- Arrays Data Structure
- Arrays Q&A
Search (39 minutes)
- Linear Search & Kata Setup
- Binary Search Algorithm
- Pseudo Code Binary Search
- Implementing Binary Search
- Two Crystal Balls Problem
- Implementing Two Crystal Balls
Sort (1 hour, 6 minutes)
- Bubble Sort
- Implementing Bubble Sort
- Linked List Data Structures
- Linked List Complexity
- Queue
- Implementing a Queue
- Queue Q&A
- Stack
- Implementing a Stack
Arrays (39 minutes)
- Arrays vs Linked List
- ArrayList
- RingBuffer
- Data Structures Q&A
Recursion (47 minutes)
- Recursion
- Path Finding: Base Case
- Path Finding: Recursive Case
- Recursion Q&A
Quick Sort (29 minutes)
- QuickSort Algorithm
- Implementing QuickSort
Doubly Linked List (35 minutes)
- Linked List: prepend, insertAt, & append
- Linked List: remove, get, & removeAt
- Linked List Q&A
- Debugging Linked List
Trees (32 minutes)
- Trees Overview
- Tree Traversals
- Implement Tree Traversal
Tree Search (1 hour)
- Breadth-First Search
- Implement Breadth-First Search
- Search Practice
- Implement Binary Tree Comparison
- Depth-First: Find
- Depth-First: Insert
- Depth-First: Delete
- Binary Search Tree Q&A
- Implement Depth-First Search
Heap (49 minutes)
- Heap
- Implementing Heap
- Tries
Graphs (1 hour, 14 minutes)
- Graphs Overview
- Searching an Adjacency Matrix
- Implementing BFS on Adjacency Matrix
- Implement DFS on Adjacency List
- Dijkstra's Shortest Path
- Implement Dijkstra's Shortest Path
- Dijkstra's Shortest Path Run Time
Maps & LRU (44 minutes)
- Maps
- LRU Cache
- LRU Cache Setup
- Implementing an LRU Cache
Wrapping Up (3 minutes)
- Wrapping Up