Practice Stone Removal Game
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
Alice and Bob alternately remove stones from a pile of n stones, with Alice first. Alice must remove 10 on the first turn, and every subsequent turn must remove exactly one fewer than the preceding turn. A player who cannot remove the required number loses. Return true if Alice wins, otherwise false.
Source: Stone Removal Game on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
n = 12
Output
true
# Example 2
Input
n = 1
Output
false
Constraints
1 <= n <= 50
Related LeetCode Problems
Practice more problems similar to Stone Removal Game.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.