Merge pull request #5 from LuaanNguyen/daily-leetcode-2425

Daily LeetCode 2425

Author: LuaanNguyen

README.md

@@ -36,7 +36,8 @@ go test ./easy/0001_two_sum
 | [2116](https://leetcode.com/problems/check-if-a-parentheses-string-can-be-valid/description/?envType=daily-question&envId=2025-01-12) | [Check if a Parentheses String Can Be Valid](/medium/2116_check_if_a_parentheses_string_can_be_valid) |          Medium           |         _`Stack`_ _`String`_ _`Greedy`_          |
 | [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 Manupulation`_               |
+|                [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`_       |
 
 ## License 🪪
 

easy/0392_is_subsequence/0392_is_subsequence_test.go

@@ -30,4 +30,4 @@ func TestIsSubsequence(t *testing.T) {
 			} 
 		})
 	}
-}
+}

medium/2425_bitwise_XOR_of_all_pairings/2425_bitwise_XOR_of_all_pairings.go

@@ -0,0 +1,26 @@
+package bitwise_XOR_of_all_pairings
+
+func xorAllNums(nums1 []int, nums2 []int) int {
+	len1 := len(nums1)
+	len2 := len(nums2)
+
+
+	freq := make(map[int]int)
+
+	for _, num := range nums1 {
+		freq[num] += len2
+	}
+
+	for _, num := range nums2 {
+		freq[num] += len1
+	}
+
+	res := 0 
+	for num, count := range freq {
+		if count % 2 != 0 {
+			res ^= num
+		}
+	}
+
+	return res
+}

medium/2425_bitwise_XOR_of_all_pairings/2425_bitwise_XOR_of_all_pairings_test.go

@@ -0,0 +1,35 @@
+package bitwise_XOR_of_all_pairings
+
+import "testing"
+
+func TestXorAllNums(t *testing.T) {
+	tests := []struct {
+		name	string 
+		nums1	[]int
+		nums2	[]int
+		expectedResult	int
+	} {
+		{
+			name: "Test Case 1",
+			nums1: []int{2,1,3},
+			nums2: []int{10,2,5,0},
+			expectedResult: 13,
+		},
+		{
+			name: "Test Case 2",
+			nums1: []int{1,2},
+			nums2: []int{3,4},
+			expectedResult: 0,
+		},
+	}
+
+	for _, test := range tests {
+		t.Run(test.name, func(t *testing.T){
+			got := xorAllNums(test.nums1, test.nums2)
+
+			if got != test.expectedResult {
+				t.Errorf("xorAllNums(%v, %v) = %d; want = %d", test.nums1, test.nums2, got, test.expectedResult)
+			}
+		})
+	}
+}