1:11:32

Algorithms Lecture 15: Greedy Algorithms, Activity Selection Problem

1:14:42

Algorithms Lecture 18: Dynamic Programming, 0-1 Knapsack Problem

1:22:10

12. Greedy Algorithms: Minimum Spanning Tree

1:02:33

Algorithms Lecture 19: Dynamic Programming, Longest Common Subsequence and Longest Common Substring

1:13:31

Algorithms Lecture 6: Solving Recurrences Using the Recursion Tree Method

1:21:51

8. Randomization: Universal & Perfect Hashing

1:13:24

Algorithms Lecture 20: Backtracking and Branch-and-Bound (Part 1)

51:20

Algorithms Lecture 17: Greedy Algorithms, Room Scheduling Problem (Interval Graph Coloring)