Beginner Lessons

14. P and NP, SAT, Poly-Time Reducibility

20. L and NL, NL = coNL

19. Games, Generalized Geography

25. Interactive Proof Systems, IP

17. Space Complexity, PSPACE, Savitch's Theorem

23. Probabilistic Computation, BPP

12. Time Complexity

6. TM Variants, Church-Turing Thesis

8. Undecidability

22. Provably Intractable Problems, Oracles

2. Nondeterminism, Closure Properties, Conversion of Regular Expressions to FA

21. Hierarchy Theorems

What do we mean by reparations?

Openings for Seeking Justice for Colonial Violence in Algeria

Lecture 1: Introduction and Overview I (14.13 Psychology and Economics, Spring 2020)

Lecture 10: Social Preferences I

Lecture 21: Poverty through the Lens of Psychology

Lecture 15: Utility from Beliefs; Learning I

Lecture 2: Introduction and Overview II

Lecture 16: Utility from Beliefs; Learning II

Lecture 14: Limited Attention

1. Algorithms and Computation

2. Data Structures and Dynamic Arrays

21. Algorithms—Next Steps

7. Binary Trees, Part 2: AVL

8. Binary Heaps

12. Bellman-Ford

11. Weighted Shortest Paths

19. Complexity

16. Dynamic Programming, Part 2: LCS, LIS, Coins

17. Dynamic Programming, Part 3: APSP, Parens, Piano

Problem Session 5

Quiz 1 review

9. Breadth-First Search

3. Sets and Sorting

5. Linear Sorting

20. Course Review

6. Binary Trees, Part 1

14. APSP and Johnson

10. Depth-First Search

Introduction to Algorithms - Problem Session 1: Asymptotic Behavior of Functions and Double-ended...

Problem Session 2 (MIT 6.006 Introduction to Algorithms, Spring 2020)

Problem Session 4

13. Dijkstra

4. Hashing

Problem Session 3

18. Dynamic Programming, Part 4: Rods, Subset Sum, Pseudopolynomial

15. Dynamic Programming, Part 1: SRTBOT, Fib, DAGs, Bowling