2025-02-26 v. 8.7.3: added "1630. Arithmetic Subarrays"

Author: fartem

README.md

@@ -706,6 +706,7 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 | 1530. Number of Good Leaf Nodes Pairs                                               | [Link](https://leetcode.com/problems/number-of-good-leaf-nodes-pairs/)                                               | [Link](./lib/medium/1530_number_of_good_leaf_nodes_pairs.rb)                                               | [Link](./test/medium/test_1530_number_of_good_leaf_nodes_pairs.rb)                                               |
 | 1557. Minimum Number of Vertices to Reach All Nodes                                 | [Link](https://leetcode.com/problems/minimum-number-of-vertices-to-reach-all-nodes/)                                 | [Link](./lib/medium/1557_minimum_number_of_vertices_to_reach_all_nodes.rb)                                 | [Link](./test/medium/test_1557_minimum_number_of_vertices_to_reach_all_nodes.rb)                                 |
 | 1609. Even Odd Tree                                                                 | [Link](https://leetcode.com/problems/even-odd-tree/)                                                                 | [Link](./lib/medium/1609_even_odd_tree.rb)                                                                 | [Link](./test/medium/test_1609_even_odd_tree.rb)                                                                 |
+| 1630. Arithmetic Subarrays                                                          | [Link](https://leetcode.com/problems/arithmetic-subarrays/)                                                          | [Link](./lib/medium/1630_arithmetic_subarrays.rb)                                                          | [Link](./test/medium/test_1630_arithmetic_subarrays.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)                                                                  |

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.7.2'
+  s.version = '8.7.3'
   s.license = 'MIT'
   s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
   s.executable = 'leetcode-ruby'

lib/medium/1630_arithmetic_subarrays.rb

@@ -0,0 +1,26 @@
+# frozen_string_literal: true
+
+# https://leetcode.com/problems/arithmetic-subarrays/
+# @param {Integer[]} nums
+# @param {Integer[]} l
+# @param {Integer[]} r
+# @return {Boolean[]}
+def check_arithmetic_subarrays(nums, l, r)
+  (0...l.size).map { |i| calculate_for_check_arithmetic_subarrays(nums, l[i], r[i]) }
+end
+
+private
+
+# @param {Integer[]} nums
+# @param {Integer} l
+# @param {Integer} r
+# @return {Boolean}
+def calculate_for_check_arithmetic_subarrays(nums, l, r)
+  n = (l...(r + 1)).map { |i| nums[i] }.sort
+
+  (0...(n.size - 1)).each do |i|
+    return false unless n[i + 1] - n[i] == n[1] - n[0]
+  end
+
+  true
+end

test/medium/test_1630_arithmetic_subarrays.rb

@@ -0,0 +1,40 @@
+# frozen_string_literal: true
+
+require_relative '../test_helper'
+require_relative '../../lib/medium/1630_arithmetic_subarrays'
+require 'minitest/autorun'
+
+class ArithmeticSubarraysTest < ::Minitest::Test
+  def test_default_one
+    assert_equal(
+      [
+        true,
+        false,
+        true
+      ],
+      check_arithmetic_subarrays(
+        [4, 6, 5, 9, 3, 7],
+        [0, 0, 2],
+        [2, 3, 5]
+      )
+    )
+  end
+
+  def test_default_two
+    assert_equal(
+      [
+        false,
+        true,
+        false,
+        false,
+        true,
+        true
+      ],
+      check_arithmetic_subarrays(
+        [-12, -9, -3, -12, -6, 15, 20, -25, -20, -15, -10],
+        [0, 1, 6, 4, 8, 7],
+        [4, 4, 9, 7, 9, 10]
+      )
+    )
+  end
+end