Add solution #2425

Author: JoshCrozier

2425-bitwise-xor-of-all-pairings.js

@@ -0,0 +1,22 @@
+/**
+ * 2425. Bitwise XOR of All Pairings
+ * https://leetcode.com/problems/bitwise-xor-of-all-pairings/
+ * Difficulty: Medium
+ *
+ * You are given two 0-indexed arrays, nums1 and nums2, consisting of non-negative integers.
+ * There exists another array, nums3, which contains the bitwise XOR of all pairings of
+ * integers between nums1 and nums2 (every integer in nums1 is paired with every integer
+ * in nums2 exactly once).
+ *
+ * Return the bitwise XOR of all integers in nums3.
+ */
+
+/**
+ * @param {number[]} nums1
+ * @param {number[]} nums2
+ * @return {number}
+ */
+var xorAllNums = function(nums1, nums2) {
+  const xor = (a, b) => a.length % 2 ? b.reduce((x, y) => x ^ y): 0;
+  return xor(nums1, nums2) ^ xor(nums2, nums1);
+};

README.md

@@ -416,6 +416,7 @@
 2390|[Removing Stars From a String](./2390-removing-stars-from-a-string.js)|Medium|
 2396|[Strictly Palindromic Number](./2396-strictly-palindromic-number.js)|Medium|
 2413|[Smallest Even Multiple](./2413-smallest-even-multiple.js)|Easy|
+2425|[Bitwise XOR of All Pairings](./2425-bitwise-xor-of-all-pairings.js)|Medium|
 2427|[Number of Common Factors](./2427-number-of-common-factors.js)|Easy|
 2429|[Minimize XOR](./2429-minimize-xor.js)|Medium|
 2469|[Convert the Temperature](./2469-convert-the-temperature.js)|Easy|