Leetcode 2683. Neighboring Bitwise XOR

Given a circular binary array original, derived[i] = original[i] ⊕ original[(i+1) mod n]; determine if there exists a binary original that produces the given derived array. The problem reduces to reconstructing original from a chosen start and checking the wrap-around consistency (equivalently, whether the XOR of all derived elements is 0).