LeetCode 837 New 21 Game - Problem Statement

Draw cards 1 to $maxPts$ uniformly. Stop when score $\geq k$. Find probability score is $\leq n$. $dp[i]$ = probability of reaching exactly score $i$. Start: $dp[0] = 1$. Transition: $dp[i] = \frac{1}{maxPts} \sum_{j=1}^{maxPts} dp[i-j]$, but only for scores $< k$ (we don't draw after reaching $k$).

Answer: $\sum_{i=k}^{n} dp[i]$. Scores from $k$ to $n$ are winning. Use sliding window for efficient sum computation.