Available question text
Determine whether Alice wins a deterministic take-away game where players must remove exactly 10, then 9, then 8, ... stones on successive turns; compute how many full moves that decreasing sequence allows from n and return true if that move count is odd (Alice takes the last legal move).
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 3360. Stone Removal Game
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source