Add daily 2683. Neighboring Bitwise XOR

Author: LuaanNguyen

README.md

@@ -39,7 +39,8 @@ go test ./easy/0001_two_sum
 | [3223](https://leetcode.com/problems/minimum-length-of-string-after-operations/description/?envType=daily-question&envId=2025-01-13)  | [Minimum Length of String After Operations](/medium/2116_check_if_a_parentheses_string_can_be_valid)                        |          Medium           |                              _`HashTable`_ _`String`_ _`Counting`_                               |
 | [2657](https://leetcode.com/problems/find-the-prefix-common-array-of-two-arrays/description/?envType=daily-question&envId=2025-01-14) | [Find the Prefix Common Array of Two Arrays](/medium/2657_find_the_prefix_common_array_of_two_arrays)                       |          Medium           |                                     _`HashTable`_ _`Array`_                                      |
 |                [2429](https://leetcode.com/problems/minimize-xor/description/?envType=daily-question&envId=2025-01-15)                | [Minimize XOR](/medium/2429_minimize_XOR)                                                                                   |          Medium           |                                       _`Bit Manipulation`_                                       |
-|        [2425](https://leetcode.com/problems/bitwise-xor-of-all-pairings/description/?envType=daily-question&envId=2025-01-16)         | [Bitwise XOR of All Pairings](/medium/2429_minimize_XOR)                                                                    |          Medium           |                              _`Bit Manipulation`_ _`Brain Teaser`_                               |
+|                              [2425](https://leetcode.com/problems/neighboring-bitwise-xor/description/)                               | [Bitwise XOR of All Pairings](/medium/2429_minimize_XOR)                                                                    |          Medium           |                              _`Bit Manipulation`_ _`Brain Teaser`_                               |
+|        [2683](https://leetcode.com/problems/bitwise-xor-of-all-pairings/description/?envType=daily-question&envId=2025-01-16)         | [Neighboring Bitwise XOR](/medium/2683_neighboring_bitwise_XOR)                                                             |          Medium           |                                  _`Bit Manipulation`_ _`Array`_                                  |
 | [1368](https://leetcode.com/problems/minimum-cost-to-make-at-least-one-valid-path-in-a-grid/?envType=daily-question&envId=2025-01-18) | [Minimum Cost to Make at Least One Valid Path in a Grid](/hard/1368_minimum_cost_to_make_at_least_one_valid_path_in_a_grid) |           Hard            | _`Breadth First Search`_ _`Graph`_ `Heap(Priority Queue)` _`Matrix`_ _`Shortest Path`_ _`Array`_ |
 
 ## License 🪪

medium/2683_neighboring_bitwise_XOR/2683_neighboring_bitwise_XOR.go

@@ -0,0 +1,18 @@
+package neighboring_bitwise_XOR
+
+
+func doesValidArrayExist(derived []int) bool {
+    original := []int{0}
+    for i := 0; i < len(derived); i++ {
+        original = append(original, derived[i]^original[i])
+    }
+    checkForZero := original[0] == original[len(original)-1]
+
+    original = []int{1}
+    for i := 0; i < len(derived); i++ {
+        original = append(original, derived[i]^original[i])
+    }
+    checkForOne := original[0] == original[len(original)-1]
+
+    return checkForZero || checkForOne
+}

medium/2683_neighboring_bitwise_XOR/2683_neighboring_bitwise_XOR_test.go

@@ -0,0 +1,37 @@
+package neighboring_bitwise_XOR
+
+import "testing"
+
+
+func TestDoesValidArrayExist(t *testing.T) {
+	tests := []struct {
+		name	string 
+		derived	[]int
+		expectedResult	bool
+	} {
+		{
+			name: "Test Case 1",
+			derived: []int{1,1,0},
+			expectedResult: true,
+		},
+		{
+			name: "Test Case 2",
+			derived: []int{1,1},
+			expectedResult: true,
+		},
+		{
+			name: "Test Case 3",
+			derived: []int{1,0},
+			expectedResult: false,
+		},
+	}
+
+	for _, test := range tests {
+		t.Run(test.name, func(t *testing.T) {
+			got := doesValidArrayExist(test.derived)
+			if got != test.expectedResult {
+				t.Errorf("doesValidArrayExist(%v) = %t; want = %t", test.derived, got, test.expectedResult)
+			}
+		})
+	}
+}