Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 1140. Stone Game II
Two-player game: from the start of the remaining piles a player may take X piles with 1 ≤ X ≤ 2M (then M = max(M, X)), and players alternate until piles are gone; compute the maximum stones Alice can obtain assuming optimal play. This is solved with minimax/dynamic programming over state (startIndex, M) (n ≤ 100).
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.