Find The Original Array of Prefix Xor — LeetCode 2433 Python Solution

The problem

You are given an integer array pref of size n. Find and return the array arr of size n that satisfies: pref[i] = arr[0] ^ arr[1] ^ ...

Example

Input

pref = [5,2,0,3,1]

Output

[5,7,2,3,2]

Explanation

From the array [5,7,2,3,2] we have the following:

Python solution

class Solution:
    def findArray(self, pref: List[int]) -> List[int]:
        return [a ^ b for a, b in pairwise([0] + pref)]

Complexity

Pattern: Bit Manipulation

Use XOR, masks and the low-bit trick to replace whole data structures with an integer. LeetCode 2433. Find The Original Array of Prefix Xor 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