Add solution #2683

JoshCrozier · JoshCrozier · commit b1d14ff7eef2 · 2025-01-16T20:20:12.000-06:00
diff --git a/2683-neighboring-bitwise-xor.js b/2683-neighboring-bitwise-xor.js
@@ -0,0 +1,26 @@
+/**
+ * 2683. Neighboring Bitwise XOR
+ * https://leetcode.com/problems/neighboring-bitwise-xor/
+ * Difficulty: Medium
+ *
+ * A 0-indexed array derived with length n is derived by computing the bitwise XOR (⊕)
+ * of adjacent values in a binary array original of length n.
+ *
+ * Specifically, for each index i in the range [0, n - 1]:
+ * - If i = n - 1, then derived[i] = original[i] ⊕ original[0].
+ * - Otherwise, derived[i] = original[i] ⊕ original[i + 1].
+ *
+ * Given an array derived, your task is to determine whether there exists a valid binary
+ * array original that could have formed derived.
+ *
+ * Return true if such an array exists or false otherwise.
+ * - A binary array is an array containing only 0's and 1's
+ */
+
+/**
+ * @param {number[]} derived
+ * @return {boolean}
+ */
+var doesValidArrayExist = function(derived) {
+  return derived.reduce((xor, n) => xor ^ n, 0) === 0;
+};
diff --git a/README.md b/README.md
@@ -447,6 +447,7 @@
 2666|[Allow One Function Call](./2666-allow-one-function-call.js)|Easy|
 2667|[Create Hello World Function](./2667-create-hello-world-function.js)|Easy|
 2677|[Chunk Array](./2677-chunk-array.js)|Easy|
+2683|[Neighboring Bitwise XOR](./2683-neighboring-bitwise-xor.js)|Medium|
 2693|[Call Function with Custom Context](./2693-call-function-with-custom-context.js)|Medium|
 2695|[Array Wrapper](./2695-array-wrapper.js)|Easy|
 2703|[Return Length of Arguments Passed](./2703-return-length-of-arguments-passed.js)|Easy|
