06 - Topological Sort | Outco Inc.

Autoplay
Autocomplete

Previous Lesson Complete and Continue

Outco: Data Structures and Algorithms

Complexity

Lecture Video: Complexity - Time and Space (15:30)
Quiz: Complexity Lecture Material
Lecture Slides: Complexity - Time and Space
Additional Resources: Complexity Analysis

Foundations

Intro to Algorithm Techniques
Looping w/ Multiple Pointers
Solution: Merge Two Sorted Arrays (6:55)
Frequency Counting
Decrease and Conquer
Solution: Bit Array Sort, Multiple Pointers 2 (1:28)

Helper Method Recursion

Lecture Video: Recursion I (12:20)
Quiz: Recursion I
Lecture Slides: Recursion I
Java Example
JavaScript Example
Python Example
Ruby Example
Additional Resources: Recursion I

Dynamic Programming

Lecture Video: Dynamic Programming Pt. I (12:46)
Lecture Video: Dynamic Programming Pt. II (13:27)
Quiz: Dynamic Programming
Lecture Slides: Dynamic Programming
Additional Resources: Dynamic Programming
Blog - Moving Window Problems

Linked List

Lecture Video: Data Structures I (14:37)
Quiz: Data Structures I
Lecture Slides: Data Structures I
Additional Resources: Data Structures I

Quadratic Sort

Lecture Video: Sorting Algorithms I (14:56)
Quiz: Sorting Algorithms I
Lecture Slides: Sorting Algorithms I
Additional Resources: Sorting Algorithms I

Binary Tree

Lecture Video: Data Structures II (14:56)
Quiz: Data Structures II
Lecture Slides: Data Structures II
Additional Resources: Data Structures II

Quasilinear Sort

Lecture Video: Sorting Algorithms II (12:30)
Quiz: Sorting Algorithms II
Quicksort In-Place (5:56)
Heapsort In-place (7:45)
Additional Resources: Sorting Algorithms II
Lecture Slides: Sorting Algorithms II

Hash Table

Lecture Video: Hash Table (14:45)
Quiz: Hash Table
Lecture Slides: Hash Table
Additional Resources: Hash Table

Graph

Lecture Video: Graph (11:37)
Graph Breadth First Search (BFS) - Diagram (3:54)
Graph Breadth First Search (BFS) - Coding (8:49)
Quiz: Data Structures IV
Lecture Slides: Data Structures IV
Additional Resources: Data Structures IV
01 - Intermediate Graph Traversals Introduction
02 - Breadth First Search (BFS)
03 - Depth First Search (DFS)
04 - DFS with Recursion
05 - Post-Order DFS
06 - Topological Sort
07 - Selection of Search Algorithm

Application Diagramming

Lecture Video: Application Diagramming (9:53) (9:53)

Binary Heap

Lecture Video: Binary Heap (16:47)

Tries

Lecture Video: Tries (10:57)

Recursion II

Lecture Video: Recursion II (13:02)
Quiz: Recursion II
Lecture Slides: Recursion II
Additional Resources: Recursion II

Distribution Sort

Lecture Video: Distribution Sort (13:48)
Quiz: Distribution Sort
Lecture Slides: Distribution Sort
Additional Resources: Distribution Sort

Object Oriented Design

Object Oriented Design with Haseeb Qureshi (88:46)

System Design

System Design and Scaling with Haseeb Qureshi (121:00)
System Design Steps

Extra Material: Old Homework Walkthroughs

Solution Video: Complexity (22:00)
Solution Video: Recursion I (13:03)
Solution Video: Data Structures I (27:54)
Solution Video: Sorting Algorithms I (25:08)
Solution Video: Data Structure II (27:18)
Solution Video: Sorting Algorithms II (29:37)
Solution Video: Data Structures III (28:23)
Solution Video: Data Structures IV (26:40)
Solution Video: Recursion II (14:23)
Solution Video: Graph Traversal Target Practice - Diagramming (13:28)
Solution Video: Graph Traversal Target Practice - Coding (9:09)
Solution Video: Dynamic Programming (20:16)
Solution Video: Sorting Algorithms III (22:40)

Extra Material: Target Practice Walkthrough

Helper Method Recursion (25:25)

Whiteboarding

How to Whiteboard Effectively (53:55)
How to Whiteboard Slides

Teach online with

06 - Topological Sort

Lesson content locked

If you're already enrolled, you'll need to login.

Enroll in Course to Unlock