playlistduration

MIT 6.046J Design and Analysis of Algorithms, Spring 2015

by MIT OpenCourseWare · 34 videos

Listed in Best free DSA courses on YouTube, ranked by total hours

Total watch time

1d 15h 28m

at 1× speed · exactly 1 day, 15 hours, 28 minutes at 1×

1×1d 15h 28m
1.25×1d 7h 34m 24s
1.5×1d 2h 18m 40s
1.75×22h 33m 9s
2×19h 44m
Average video1h 9m 39s
Longest1h 25m 25s
Shortest22m 24s
Compare Open on YouTube JSON

Plan to finish

About 40 days at an hour a day

Pick a daily pace and the days you'll watch. Ticked videos are skipped.

Days

At one hour a day, every day, this playlist takes about 40 days. Turn on JavaScript to plan around your week.

Videos (34)

1d 15h 28m in total · tick what you've watched

Tick videos you've watched — progress is saved in this browser.

Videos to
Watched
1 1. Course Overview, Interval Scheduling 1:23:35 2016-03-04
2 2. Divide & Conquer: Convex Hull, Median Finding 1:20:35 2016-03-04
3 R1. Matrix Multiplication and the Master Theorem 53:46 2016-03-04
4 3. Divide & Conquer: FFT 1:20:52 2016-03-04
5 R2. 2-3 Trees and B-Trees 30:45 2016-03-04
6 4. Divide & Conquer: van Emde Boas Trees 1:20:15 2016-03-04
7 5. Amortization: Amortized Analysis 1:15:53 2016-03-04
8 6. Randomization: Matrix Multiply, Quicksort 1:21:52 2016-03-04
9 R4. Randomized Select and Randomized Quicksort 39:30 2016-03-04
10 7. Randomization: Skip Lists 1:20:56 2016-03-04
11 8. Randomization: Universal & Perfect Hashing 1:21:51 2016-03-04
12 R5. Dynamic Programming 52:03 2016-03-04
13 9. Augmentation: Range Trees 1:24:34 2016-03-04
14 10. Dynamic Programming: Advanced DP 1:20:08 2016-03-04
15 11. Dynamic Programming: All-Pairs Shortest Paths 1:21:49 2016-03-04
16 12. Greedy Algorithms: Minimum Spanning Tree 1:22:10 2016-03-04
17 R6. Greedy Algorithms 22:24 2016-03-04
18 13. Incremental Improvement: Max Flow, Min Cut 1:22:58 2016-03-04
19 14. Incremental Improvement: Matching 1:22:32 2016-03-04
20 R7. Network Flow and Matching 51:12 2016-03-04
21 15. Linear Programming: LP, reductions, Simplex 1:22:27 2016-03-04
22 16. Complexity: P, NP, NP-completeness, Reductions 1:25:25 2016-06-13
23 R8. NP-Complete Problems 45:47 2016-03-04
24 17. Complexity: Approximation Algorithms 1:21:08 2016-03-04
25 18. Complexity: Fixed-Parameter Algorithms 1:17:43 2016-06-13
26 R9. Approximation Algorithms: Traveling Salesman Problem 31:59 2016-03-04
27 19. Synchronous Distributed Algorithms: Symmetry-Breaking. Shortest-Paths Spanning Trees 1:17:34 2016-03-04
28 20. Asynchronous Distributed Algorithms: Shortest-Paths Spanning Trees 1:12:03 2021-07-31
29 R10. Distributed Algorithms 50:19 2016-03-04
30 21. Cryptography: Hash Functions 1:22:01 2016-03-04
31 22. Cryptography: Encryption 1:24:15 2016-03-04
32 R11. Cryptography: More Primitives 49:30 2016-03-04
33 23. Cache-Oblivious Algorithms: Medians & Matrices 1:20:28 2016-12-06
34 24. Cache-Oblivious Algorithms: Searching & Sorting 1:17:41 2016-03-04

Embed a badge

Show the watch time in a README or course description — it links back here and updates itself

Watch time: 1d 15h 28m · 34 videos

Markdown
[![Watch time: 1d 15h 28m · 34 videos](https://playlistduration.com/badge/playlist/PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp.svg)](https://playlistduration.com/playlist/PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp)
HTML
<a href="https://playlistduration.com/playlist/PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp"><img src="https://playlistduration.com/badge/playlist/PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp.svg" alt="Watch time: 1d 15h 28m · 34 videos" width="228" height="20"></a>

Add ?speed=1.5 to the image URL for the time at that speed, ?label=Course to change the left text, or ?style=flat-square for square corners.

Want the numbers themselves? GET https://playlistduration.com/api/v1/playlist/PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp returns them as JSON — free, no key. API docs →

Data from the YouTube Data API as of 2026-09-22 (cached). Private or deleted videos are excluded from totals.