Problem · Array

Stone Game III

HardGoogle logoGoogleFULLTIMEPHONE SCREEN
See Google hiring insights

Problem statement

Alice and Bob play a game using the integer array stoneValue. Alice moves first. On each turn, a player removes the first 1, 2, or 3 remaining stones and adds their values to that player's score. Play continues until no stones remain.

The problem statement continues
Pro

Examples

Example 1

stoneValue = [1,2,3,7]return = "Bob"

No matter whether Alice takes one, two, or three stones, Bob can take the remaining high-value group and finish with the larger score.

FastPrep Pro
Reported in 1 Google interview this week

Unlock this recently reported problem

FastPrep Pro gives you full access to interview problems reported within the last week.

  • Full problem statement and constraints
  • 2 more worked examples, explained
  • Guided hints and editorial
  • Run your code on real test cases
$9/month

Pro subscription, billed yearly — or $19 month-to-month. Cancel anytime.

Free plan — 2 of 2 free unlocks used this week
CodePython 3
Run and Submit unlock with Pro
FastPrep Pro
Reported in 1 Google interview this week

Unlock this recently reported problem

FastPrep Pro gives you full access to interview problems reported within the last week.

  • Full problem statement and constraints
  • 2 more worked examples, explained
  • Guided hints and editorial
  • Run your code on real test cases
$9/month

Pro subscription, billed yearly — or $19 month-to-month. Cancel anytime.

Free plan — 2 of 2 free unlocks used this week