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

Soup Servings

Explore how to apply dynamic programming techniques to solve the soup servings problem, which involves probabilistic serving of two soups. Understand how to model the problem, compute probabilities efficiently, and implement the solution in C++ to master this common coding interview challenge.

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 ...