From 8bd8e8c5c3d958b622afa7e26bd08a1dab83a303 Mon Sep 17 00:00:00 2001
From: fartem <jaman.smlnsk@gmail.com>
Date: Wed, 5 Feb 2025 08:30:36 +0300
Subject: [PATCH] 2025-02-05 v. 8.4.3: added "1310. XOR Queries of a Subarray"

---
 README.md                                     |  1 +
 leetcode-ruby.gemspec                         |  2 +-
 lib/medium/1310_xor_queries_of_a_subarray.rb  | 22 +++++++++++
 .../test_1310_xor_queries_of_a_subarray.rb    | 37 +++++++++++++++++++
 4 files changed, 61 insertions(+), 1 deletion(-)
 create mode 100644 lib/medium/1310_xor_queries_of_a_subarray.rb
 create mode 100644 test/medium/test_1310_xor_queries_of_a_subarray.rb

diff --git a/README.md b/README.md
index 967e2964..1c20faff 100644
--- a/README.md
+++ b/README.md
@@ -675,6 +675,7 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 | 1288. Remove Covered Intervals                                   | [Link](https://leetcode.com/problems/remove-covered-intervals/)                                    | [Link](./lib/medium/1288_remove_covered_intervals.rb)                                   | [Link](./test/medium/test_1288_remove_covered_intervals.rb)                                   |
 | 1302. Deepest Leaves Sum                                         | [Link](https://leetcode.com/problems/deepest-leaves-sum/)                                          | [Link](./lib/medium/1302_deepest_leaves_sum.rb)                                         | [Link](./test/medium/test_1302_deepest_leaves_sum.rb)                                         |
 | 1305. All Elements in Two Binary Search Trees                    | [Link](https://leetcode.com/problems/all-elements-in-two-binary-search-trees/)                     | [Link](./lib/medium/1305_all_elements_in_two_binary_search_trees.rb)                    | [Link](./test/medium/test_1305_all_elements_in_two_binary_search_trees.rb)                    |
+| 1310. XOR Queries of a Subarray                                  | [Link](https://leetcode.com/problems/xor-queries-of-a-subarray/)                                   | [Link](./lib/medium/1310_xor_queries_of_a_subarray.rb)                                  | [Link](./test/medium/test_1310_xor_queries_of_a_subarray.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)                                |
diff --git a/leetcode-ruby.gemspec b/leetcode-ruby.gemspec
index 6f3f7f19..58e58619 100644
--- a/leetcode-ruby.gemspec
+++ b/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.4.2'
+  s.version = '8.4.3'
   s.license = 'MIT'
   s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
   s.executable = 'leetcode-ruby'
diff --git a/lib/medium/1310_xor_queries_of_a_subarray.rb b/lib/medium/1310_xor_queries_of_a_subarray.rb
new file mode 100644
index 00000000..19cd1509
--- /dev/null
+++ b/lib/medium/1310_xor_queries_of_a_subarray.rb
@@ -0,0 +1,22 @@
+# frozen_string_literal: true
+
+# https://leetcode.com/problems/xor-queries-of-a-subarray/
+# @param {Integer[]} arr
+# @param {Integer[][]} queries
+# @return {Integer[]}
+def xor_queries(arr, queries)
+  (1...arr.size).each { |i| arr[i] ^= arr[i - 1] }
+
+  result = ::Array.new(queries.size)
+
+  queries.each_with_index do |query, i|
+    result[i] =
+      if query[0].zero?
+        arr[query[1]]
+      else
+        arr[query[0] - 1] ^ arr[query[1]]
+      end
+  end
+
+  result
+end
diff --git a/test/medium/test_1310_xor_queries_of_a_subarray.rb b/test/medium/test_1310_xor_queries_of_a_subarray.rb
new file mode 100644
index 00000000..004a9d8c
--- /dev/null
+++ b/test/medium/test_1310_xor_queries_of_a_subarray.rb
@@ -0,0 +1,37 @@
+# frozen_string_literal: true
+
+require_relative '../test_helper'
+require_relative '../../lib/medium/1310_xor_queries_of_a_subarray'
+require 'minitest/autorun'
+
+class XorQueriesOfASubarrayTest < ::Minitest::Test
+  def test_default_one
+    assert_equal(
+      [2, 7, 14, 8],
+      xor_queries(
+        [1, 3, 4, 8],
+        [
+          [0, 1],
+          [1, 2],
+          [0, 3],
+          [3, 3]
+        ]
+      )
+    )
+  end
+
+  def test_default_two
+    assert_equal(
+      [8, 0, 4, 4],
+      xor_queries(
+        [4, 8, 2, 10],
+        [
+          [2, 3],
+          [1, 3],
+          [0, 0],
+          [0, 3]
+        ]
+      )
+    )
+  end
+end