Nim Game — LeetCode 292 Python Solution
EasyBrainteaserMathGame Theory
- Problem
- #292
- Pattern
- Math and Number Theory
- Reading time
- 2 min
- Source
- leetcode.com
The problem
You are playing the following Nim Game with your friend: Initially, there is a heap of stones on the table. You and your friend will alternate taking turns, and you go first.
Example
- Input
- n = 4
- Output
- false
- Explanation
- These are the possible outcomes:
Python solution
Python
class Solution:
def canWinNim(self, n: int) -> bool:
return n % 4 != 0Complexity
| Measure | Complexity |
|---|---|
| Time | O(1) |
| Space | O(1) auxiliary |
Pattern: Math and Number Theory
Find the closed form, the invariant, or the modular identity — and skip the loop entirely. LeetCode 292. Nim Game is filed here on both counts: the reference solution below belongs to the algorithm family this hub collects, and LeetCode tags it Math.
The math and number theory guide has the Python template for the pattern and the 485 LeetCode problems that use it.
Related problems
Frequently asked questions
- How hard is LeetCode 292. Nim Game?
- LeetCode 292. Nim Game is rated Easy on LeetCode.
- What is the time complexity of LeetCode 292. Nim Game?
- The Python solution on this page runs in O(1).
- What is the space complexity of LeetCode 292. Nim Game?
- The Python solution on this page uses O(1) auxiliary space.
- What topics does LeetCode 292. Nim Game cover?
- LeetCode 292. Nim Game is tagged Brainteaser, Math and Game Theory on LeetCode.