Last Minute Lecture

Motivation, Autonomy, and Intrinsic Drive in ADD: My Marshmallow Caught Fire | Chapter 22 of Scattered Minds by Gabor Maté Welcome to Last Minute Lecture’s summary of Chapter 22 from Scattered Minds by Dr. Gabor Maté. This chapter challenges the myth that ADD is caused by laziness or weak willpower. Dr. Maté draws on research and clinical experience to show that real motivation arises from secure attachment and authentic autonomy—not from punishment, rewards, or behavioral techniques. Watch the full chapter video below, and subscribe to Last Minute Lecture for more psychology-based, trauma-informed guides and parenting resources: Subscribe to Last Minute Lecture for more chapter-by-chapter textbook summaries and child development insights. True Motivation Comes From Within Dr. Maté, referencing Edward Deci and Natalie Rathvon, argues that motivation in children—especially those with ADD—cannot be forced or externally engineered. Attempts to motivate with threats, praise,...

Shortest Path Algorithms — Bellman-Ford, Dijkstra & DAG Methods Explained | Chapter 22 in Introduction to Algorithms Chapter 22 of Introduction to Algorithms (CLRS) provides a comprehensive guide to solving the single-source shortest-path problem in weighted, directed graphs. These algorithms are the foundation of many practical applications in computer science, such as GPS navigation, internet routing, and task scheduling. The chapter introduces essential algorithmic tools—including relaxation and optimal substructure—before explaining three powerful solutions: the Bellman-Ford algorithm, DAG shortest paths, and Dijkstra’s algorithm. 📺 Watch the full podcast-style summary above or continue reading for a detailed breakdown of key concepts, methods, and properties that make shortest-path algorithms so essential in graph theory. Understanding the Shortest Path Problem The single-source shortest path problem asks: given a weighted, directed graph and a source vertex s , w...