Soup Servings

Understand how to apply dynamic programming to calculate the probability that soup A will empty before soup B using random serving operations. This lesson helps you develop an approach to handle probabilistic optimization problems and implement your solution clearly in code.