LeetCode 808 Soup Servings - Walkthrough

Serve soup from two pots A and B. Each operation reduces (A, B) by one of 4 choices. Find probability A empties first (or tie counts as 0.5).

For small $N$, use DP: $dp[a][b]$ = probability A empties first from state $(a, b)$. observation: on average, A decreases faster than B (operations favor reducing A). For large $N$, probability approaches 1. improvement: for $N > 4800$, return 1.0 directly. The error is negligible. This bounds the DP state space.