Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- 2048 Game Backend
Coding
- 24 Game
Coding
- Alice and Bob Playing Flower Game
Coding
- Amount of New Area Painted Each Day
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 837. New 21 Game
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source