Chalkboard XOR Game — LeetCode 810 Python Solution
HardBit ManipulationBrainteaserArrayMathGame Theory
- Problem
- #810
- Pattern
- Bit Manipulation
- Reading time
- 2 min
- Source
- leetcode.com
The problem
You are given an array of integers nums represents the numbers written on a chalkboard. Alice and Bob take turns erasing exactly one number from the chalkboard, with Alice starting first.
Example
- Input
- nums = [1,1,2]
- Output
- false
- Explanation
- Alice has two choices: erase 1 or erase 2.
Python solution
Python
class Solution:
def xorGame(self, nums: List[int]) -> bool:
return len(nums) % 2 == 0 or reduce(xor, nums) == 0Complexity
| Measure | Complexity |
|---|---|
| Time | O(n), where n is the length of the array \textit{nums} |
| Space | O(1) auxiliary |
Pattern: Bit Manipulation
Use XOR, masks and the low-bit trick to replace whole data structures with an integer. LeetCode 810. Chalkboard XOR Game is filed here on both counts: the reference solution below belongs to the algorithm family this hub collects, and LeetCode tags it Bit Manipulation.
The bit manipulation guide has the Python template for the pattern and the 194 LeetCode problems that use it.
Related problems
Frequently asked questions
- How hard is LeetCode 810. Chalkboard XOR Game?
- LeetCode 810. Chalkboard XOR Game is rated Hard on LeetCode.
- What is the time complexity of LeetCode 810. Chalkboard XOR Game?
- The Python solution on this page runs in O(n), where n is the length of the array \textit{nums}.
- What is the space complexity of LeetCode 810. Chalkboard XOR Game?
- The Python solution on this page uses O(1) auxiliary space.
- What topics does LeetCode 810. Chalkboard XOR Game cover?
- LeetCode 810. Chalkboard XOR Game is tagged Bit Manipulation, Brainteaser, Array, Math and Game Theory on LeetCode.