Available question text
Two players alternately pick stones (Alice first) from n items where stone i gives aliceValues[i] to Alice and bobValues[i] to Bob; under optimal play, determine whether Alice wins (1), Bob wins (-1), or it's a draw (0). n can be up to 1e5, so an O(n log n) or better approach is required.
Related questions
Continue with questions that share topics or the same question type.
- Stone Game
Coding
- Stone Game II
Coding
- Stone Game III
Coding
- Stone Game IV
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1686. Stone Game VI
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source