Create Neighboring Bitwise XOR.java

varunu28 · web-flow · commit e8baf509b762 · 2025-01-16T17:13:07.000-08:00
diff --git a/Medium/Neighboring Bitwise XOR.java b/Medium/Neighboring Bitwise XOR.java
@@ -0,0 +1,16 @@
+class Solution {
+    public boolean doesValidArrayExist(int[] derived) {
+        int n = derived.length;
+        int[] original = new int[n + 1];
+        for (int i = 0; i < derived.length; i++) {
+            original[i + 1] = derived[i] ^ original[i];
+        }
+        boolean checkForZero = (original[0] == original[n]);
+        original[0] = 1;
+        for (int i = 0; i < n; i++) {
+            original[i + 1] = derived[i] ^ original[i];
+        }
+        boolean checkForOne = (original[0] == original[n]);
+        return checkForZero || checkForOne;
+    }
+}
