Neighboring Bitwise XOR Python Solution

lcpy gen -n 2683   # by problem number
lcpy gen -s neighboring_bitwise_xor   # by problem name

Input: derived = [1,1,0]
Output: true
Explanation: A valid original array that gives derived is [0,1,0].
derived[0] = original[0] ⊕ original[1] = 0 ⊕ 1 = 1
derived[1] = original[1] ⊕ original[2] = 1 ⊕ 0 = 1
derived[2] = original[2] ⊕ original[0] = 0 ⊕ 0 = 0

Input: derived = [1,1]
Output: true
Explanation: A valid original array that gives derived is [0,1].
derived[0] = original[0] ⊕ original[1] = 1
derived[1] = original[1] ⊕ original[0] = 1

Input: derived = [1,0]
Output: false
Explanation: There is no valid original array that gives derived.

class Solution:
    # Time: O(n)
    # Space: O(1)
    def does_valid_array_exist(self, derived: list[int]) -> bool:
        # Each original value appears exactly twice across the derived XORs,
        # so every pair cancels and the total XOR must be 0.
        total = 0
        for value in derived:
            total ^= value
        return total == 0