2025-01-16 v. 8.1.0: added "2425. Bitwise XOR of All Pairings"

README.md

@@ -648,6 +648,7 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 | 951. Flip Equivalent Binary Trees                                | [Link](https://leetcode.com/problems/flip-equivalent-binary-trees/)                                | [Link](./lib/medium/951_flip_equivalent_binary_trees.rb)                                | [Link](./test/medium/test_951_flip_equivalent_binary_trees.rb)                                |
 | 1400. Construct K Palindrome Strings                             | [Link](https://leetcode.com/problems/construct-k-palindrome-strings/)                              | [Link](./lib/medium/1400_construct_k_palindrome_strings.rb)                             | [Link](./test/medium/test_1400_construct_k_palindrome_strings.rb)                             |
 | 2116. Check if a Parentheses String Can Be Valid                 | [Link](https://leetcode.com/problems/check-if-a-parentheses-string-can-be-valid/)                  | [Link](./lib/medium/2116_check_if_a_parentheses_string_can_be_valid.rb)                 | [Link](./test/medium/test_2116_check_if_a_parentheses_string_can_be_valid.rb)                 |
+| 2425. Bitwise XOR of All Pairings                                | [Link](https://leetcode.com/problems/bitwise-xor-of-all-pairings/)                                 | [Link](./lib/medium/2425_bitwise_xor_of_all_pairings.rb)                                | [Link](./test/medium/test_2425_bitwise_xor_of_all_pairings.rb)                                |
 | 2429. Minimize XOR                                               | [Link](https://leetcode.com/problems/minimize-xor/)                                                | [Link](./lib/medium/2429_minimize_xor.rb)                                               | [Link](./test/medium/test_2429_minimize_xor.rb)                                               |
 | 2657. Find the Prefix Common Array of Two Arrays                 | [Link](https://leetcode.com/problems/find-the-prefix-common-array-of-two-arrays/)                  | [Link](./lib/medium/2657_find_the_prefix_common_array_of_two_arrays.rb)                 | [Link](./test/medium/test_2657_find_the_prefix_common_array_of_two_arrays.rb)                 |
 | 3223. Minimum Length of String After Operations                  | [Link](https://leetcode.com/problems/minimum-length-of-string-after-operations/)                   | [Link](./lib/medium/3223_minimum_length_of_string_after_operations.rb)                  | [Link](./test/medium/test_3223_minimum_length_of_string_after_operations.rb)                  |

leetcode-ruby.gemspec

@@ -5,7 +5,7 @@ require 'English'
 ::Gem::Specification.new do |s|
   s.required_ruby_version = '>= 3.0'
   s.name = 'leetcode-ruby'
-  s.version = '8.0.9'
+  s.version = '8.1.0'
   s.license = 'MIT'
   s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
   s.executable = 'leetcode-ruby'

lib/medium/2425_bitwise_xor_of_all_pairings.rb

@@ -0,0 +1,19 @@
+# frozen_string_literal: true
+
+# https://leetcode.com/problems/bitwise-xor-of-all-pairings/
+# @param {Integer[]} nums1
+# @param {Integer[]} nums2
+# @return {Integer}
+def xor_all_nums(nums1, nums2)
+  c1 = nums1.size
+  c2 = nums2.size
+
+  x1 = 0
+  x2 = 0
+
+  nums2.each { |num| x2 ^= num } if c1.odd?
+
+  nums1.each { |num| x1 ^= num } if c2.odd?
+
+  x1 ^ x2
+end

test/medium/test_2425_bitwise_xor_of_all_pairings.rb

@@ -0,0 +1,27 @@
+# frozen_string_literal: true
+
+require_relative '../test_helper'
+require_relative '../../lib/medium/2425_bitwise_xor_of_all_pairings'
+require 'minitest/autorun'
+
+class BitwiseXOROfAllPairingsTest < ::Minitest::Test
+  def test_default_one
+    assert_equal(
+      13,
+      xor_all_nums(
+        [2, 1, 3],
+        [10, 2, 5, 0]
+      )
+    )
+  end
+
+  def test_default_two
+    assert_equal(
+      0,
+      xor_all_nums(
+        [1, 2],
+        [3, 4]
+      )
+    )
+  end
+end