Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3360. Stone Removal Game
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).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.