Alice and Bob are playing a game where they take turns removing stones from a pile, with Alice going first.
The player who cannot make a move loses the game.
Given a positive integer n, return true if Alice wins the game and false otherwise.
Example 1:
Input: n = 12
Output: true
Explanation:
Example 2:
Input: n = 1
Output: false
Explanation:
Constraints:
1 <= n <= 50Solutions for this problem are being prepared.
Try solving it yourselfHow many LeetCode problems should you solve? #leetcode #techinterview #developer #softwareengineer • CrioDo • 304,699 views views
Watch 9 more video solutions →Practice Stone Removal Game with our built-in code editor and test cases.
Practice on FleetCodePractice this problem
Open in Editor