Chalkboard XOR Game Python Solution with Tests

lcpy gen -n 810   # by problem number
lcpy gen -s chalkboard_xor_game   # by problem name

Input: nums = [1,1,2]
Output: false
Explanation:
Alice has two choices: erase 1 or erase 2.
If she erases 1, the nums array becomes [1, 2]. The bitwise XOR of all the elements of the chalkboard is 1 XOR 2 = 3. Now Bob can remove any element he wants, because Alice will be the one to erase the last element and she will lose.
If Alice erases 2 first, now nums become [1, 1]. The bitwise XOR of all the elements of the chalkboard is 1 XOR 1 = 0. Alice will lose.

Input: nums = [0,1]
Output: true

Input: nums = [1,2,3]
Output: true

from functools import reduce
from operator import xor


class Solution:
    # Time: O(n)
    # Space: O(1)
    def xor_game(self, nums: list[int]) -> bool:
        # Alice loses only when the count is odd and the total XOR is nonzero:
        # with an even count she can always mirror Bob's erasures (two copies of
        # every value would XOR to 0), and a zero XOR wins on the spot.
        return len(nums) % 2 == 0 or reduce(xor, nums, 0) == 0