Practice Stone Game

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#877

LeetCode Problem

Stone Game

Array Math Dynamic Programming Game Theory

Problem Statement

Alice and Bob play a game with piles of stones. There are an even number of piles arranged in a row, and each pile has a positive integer number of stones piles[i]. The objective of the game is to end with the most stones. The total number of stones across all the piles is odd, so there are no ties. Alice and Bob take turns, with Alice starting first. Each turn, a player takes the entire pile of stones either from the beginning or from the end of the row. This continues until there are no more piles left, at which point the person with the most stones wins. Assuming Alice and Bob play optimally, return true if Alice wins the game, or false if Bob wins.

Source: Stone Game on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input

piles = [5,3,4,5]

Output

true

# Example 2

Input

piles = [3,7,2,3]

Output

true

Constraints

2 <= piles.length <= 500

piles.length is even.

1 <= piles[i] <= 500

sum(piles[i]) is odd.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free