Add solution #1734

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,507 LeetCode solutions in JavaScript
+# 1,508 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1335,6 +1335,7 @@
 1728|[Cat and Mouse II](./solutions/1728-cat-and-mouse-ii.js)|Hard|
 1732|[Find the Highest Altitude](./solutions/1732-find-the-highest-altitude.js)|Easy|
 1733|[Minimum Number of People to Teach](./solutions/1733-minimum-number-of-people-to-teach.js)|Medium|
+1734|[Decode XORed Permutation](./solutions/1734-decode-xored-permutation.js)|Medium|
 1748|[Sum of Unique Elements](./solutions/1748-sum-of-unique-elements.js)|Easy|
 1749|[Maximum Absolute Sum of Any Subarray](./solutions/1749-maximum-absolute-sum-of-any-subarray.js)|Medium|
 1752|[Check if Array Is Sorted and Rotated](./solutions/1752-check-if-array-is-sorted-and-rotated.js)|Easy|

solutions/1734-decode-xored-permutation.js

@@ -0,0 +1,40 @@
+/**
+ * 1734. Decode XORed Permutation
+ * https://leetcode.com/problems/decode-xored-permutation/
+ * Difficulty: Medium
+ *
+ * There is an integer array perm that is a permutation of the first n positive integers,
+ * where n is always odd.
+ *
+ * It was encoded into another integer array encoded of length n - 1, such that
+ * encoded[i] = perm[i] XOR perm[i + 1]. For example, if perm = [1,3,2], then encoded = [2,1].
+ *
+ * Given the encoded array, return the original array perm. It is guaranteed that the answer
+ * exists and is unique.
+ */
+
+/**
+ * @param {number[]} encoded
+ * @return {number[]}
+ */
+var decode = function(encoded) {
+  const n = encoded.length + 1;
+  let totalXor = 0;
+  for (let i = 1; i <= n; i++) {
+    totalXor ^= i;
+  }
+
+  let oddXor = 0;
+  for (let i = 1; i < encoded.length; i += 2) {
+    oddXor ^= encoded[i];
+  }
+
+  const result = new Array(n);
+  result[0] = totalXor ^ oddXor;
+
+  for (let i = 0; i < n - 1; i++) {
+    result[i + 1] = result[i] ^ encoded[i];
+  }
+
+  return result;
+};