Practice Decode XORed Array

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Easy#1720

LeetCode Problem

Decode XORed Array

Array Bit Manipulation

Problem Statement

There is a hidden integer array arr that consists of n non-negative integers. It was encoded into another integer array encoded of length n - 1, such that encoded[i] = arr[i] XOR arr[i + 1]. For example, if arr = [1,0,2,1], then encoded = [1,2,3]. You are given the encoded array. You are also given an integer first, that is the first element of arr, i.e. arr[0]. Return the original array arr. It can be proved that the answer exists and is unique.

Source: Decode XORed Array on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input

encoded = [1,2,3], first = 1

Output

[1,0,2,1]

# Example 2

Input

encoded = [6,2,7,3], first = 4

Output

[4,2,0,7,4]

Constraints

2 <= n <= 10^4

encoded.length == n - 1

0 <= encoded[i] <= 10^5

0 <= first <= 10^5

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free