Leetcode 1734. Decode XORed Permutation
Reconstruct the unique permutation perm of 1..n (n odd) given adjacent XORs encoded[i] = perm[i] ⊕ perm[i+1]; use XOR properties (overall XOR of 1..n and XOR of every other encoded entry) to recover the first element and then derive the rest sequentially.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Hello Interview Premium
Your account is free and you can post anonymously if you choose.