Problem Session 3

Lecture 8 of 29 in Introduction to Algorithms (MIT 6.006) by Free Academy. 1 h 26 min. Watch on YouTube

Course: Introduction to Algorithms (MIT 6.006) (Computer Science). Covers: algorithms data structures sorting hashing graphs bfs dfs shortest paths dynamic programming complexity big o.

All lectures in Introduction to Algorithms (MIT 6.006)

  1. 1. Algorithms and Computation · 46 min
  2. 2. Data Structures and Dynamic Arrays · 50 min
  3. Introduction to Algorithms - Problem Session 1: Asymptotic Behavior of Functions and Double-ended... · 1 h 27 min
  4. 3. Sets and Sorting · 53 min
  5. 4. Hashing · 53 min
  6. Problem Session 2 (MIT 6.006 Introduction to Algorithms, Spring 2020) · 1 h 28 min
  7. 5. Linear Sorting · 52 min
  8. Problem Session 3 · 1 h 26 min
  9. 6. Binary Trees, Part 1 · 51 min
  10. 7. Binary Trees, Part 2: AVL · 54 min
  11. Problem Session 4 · 1 h 30 min
  12. 8. Binary Heaps · 51 min
  13. 9. Breadth-First Search · 53 min
  14. Quiz 1 review · 1 h 26 min
  15. 10. Depth-First Search · 52 min
  16. 11. Weighted Shortest Paths · 58 min
  17. Problem Session 5 · 1 h 28 min
  18. 12. Bellman-Ford · 58 min
  19. 13. Dijkstra · 57 min
  20. 14. APSP and Johnson · 57 min
  21. Quiz 2 Review · 1 h 23 min
  22. 15. Dynamic Programming, Part 1: SRTBOT, Fib, DAGs, Bowling · 57 min
  23. 16. Dynamic Programming, Part 2: LCS, LIS, Coins · 59 min
  24. 17. Dynamic Programming, Part 3: APSP, Parens, Piano · 1 h 4 min
  25. 18. Dynamic Programming, Part 4: Rods, Subset Sum, Pseudopolynomial · 1 h 4 min
  26. 19. Complexity · 59 min
  27. Quiz 3 Review · 1 h 24 min
  28. 20. Course Review · 56 min
  29. 21. Algorithms—Next Steps · 59 min