Watch

Pick a lecture

1. Week 1

   • L1The geometry of linear equations39:48
   • L2Elimination with matrices47:41

2. Week 2

   • L3Multiplication and inverse matrices46:48

1. Week 1

   • L1Algorithms and Computation45:38
   • L2Data Structures and Dynamic Arrays50:17

2. Week 2

   • L3Sets and Sorting52:55
   • L4Hashing52:54

3. Week 3

   • L5Linear Sorting51:56
   • L6Binary Trees, Part 150:57

4. Week 4

   • L7Binary Trees, Part 2: AVL54:08
   • L8Binary Heaps50:51

5. Week 5

   • L9Breadth-First Search52:52
   • L10Depth-First Search52:22

6. Week 6

   • L11Weighted Shortest Paths57:32
   • L12Bellman-Ford57:39

7. Week 7

   • L13Dijkstra57:21
   • L14APSP and Johnson56:52

8. Week 8

   • L15Dynamic Programming, Part 1: SRTBOT, Fib, DAGs, Bowling57:17
   • L16Dynamic Programming, Part 2: LCS, LIS, Coins58:43

9. Week 9

   • L17Dynamic Programming, Part 3: APSP, Parens, Piano1:03:44
   • L18Dynamic Programming, Part 4: Rods, Subset Sum, Pseudopolynomial1:03:44

10. Week 10

    • L19Complexity59:08
    • L20Course Review55:34

11. Week 11

    • L21Algorithms—Next Steps59:24

1. Week 1

   • L1Introduction to CS and Programming Using Python1:03:29
   • L2Strings, Input/Output, and Branching1:18:57

2. Week 2

   • L3Iteration46:41