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).