Leetcode 837. New 21 Game

Compute the probability that Alice’s final total is ≤ n when she draws i.i.d. uniform integers from [1, maxPts] until her score reaches at least k; the core challenge is computing the DP of reaching each score efficiently, typically using prefix sums or a sliding-window to avoid O(n*maxPts) transitions.