Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns

Soup Servings

Understand how to apply dynamic programming methods to compute the probability that soup A runs out before soup B in a randomized serving scenario. Learn to optimize solutions for stochastic processes using memoization for precise probability calculations.

We'll cover the following...

Statement

You begin with two types of soup, A and B, each containing n milliliters. During each turn, exactly one of the following four operations is selected uniformly at random (each with probability 0.250.25), independent of all prior turns:

  • Serve 100100 mL of soup A and 00 mL of soup B.

  • Serve ...