Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.