2025-01-01 v. 7.6.0: added "4. Median of Two Sorted Arrays"

README.md

@@ -624,3 +624,9 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 | 797. All Paths From Source to Target                            | [Link](https://leetcode.com/problems/all-paths-from-source-to-target/)                            | [Link](./lib/medium/797_all_paths_from_source_to_target.rb)                            | [Link](./test/medium/test_797_all_paths_from_source_to_target.rb)                            |
 | 814. Binary Tree Pruning                                        | [Link](https://leetcode.com/problems/binary-tree-pruning/)                                        | [Link](./lib/medium/814_binary_tree_pruning.rb)                                        | [Link](./test/medium/test_814_binary_tree_pruning.rb)                                        |
 | 817. Linked List Components                                     | [Link](https://leetcode.com/problems/linked-list-components/)                                     | [Link](./lib/medium/817_linked_list_components.rb)                                     | [Link](./test/medium/test_817_linked_list_components.rb)                                     |
+
+### Hard
+
+| Name                           | Link to LeetCode                                                   | Link to solution                                    | Link to tests                                             |
+| ------------------------------ | ------------------------------------------------------------------ | --------------------------------------------------- | --------------------------------------------------------- |
+| 4. Median of Two Sorted Arrays | [Link](https://leetcode.com/problems/median-of-two-sorted-arrays/) | [Link](./lib/hard/4_median_of_two_sorted_arrays.rb) | [Link](./test/hard/test_4_median_of_two_sorted_arrays.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 = '7.5.9'
+  s.version = '7.6.0'
   s.license = 'MIT'
   s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
   s.executable = 'leetcode-ruby'

lib/hard/4_median_of_two_sorted_arrays.rb

@@ -0,0 +1,16 @@
+# frozen_string_literal: true
+
+# https://leetcode.com/problems/median-of-two-sorted-arrays/
+# @param {Integer[]} nums1
+# @param {Integer[]} nums2
+# @return {Float}
+def find_median_sorted_arrays(nums1, nums2)
+  c = nums1 << nums2
+  c.flatten!.sort!
+
+  if c.size.even?
+    (c[c.size / 2] + c[c.size / 2 - 1]) / 2.0
+  else
+    c[c.size / 2]
+  end
+end

test/hard/test_4_median_of_two_sorted_arrays.rb

@@ -0,0 +1,27 @@
+# frozen_string_literal: true
+
+require_relative '../test_helper'
+require_relative '../../lib/hard/4_median_of_two_sorted_arrays'
+require 'minitest/autorun'
+
+class MedianOfTwoSortedArraysTest < ::Minitest::Test
+  def test_default_one
+    assert_equal(
+      2.00000,
+      find_median_sorted_arrays(
+        [1, 3],
+        [2]
+      )
+    )
+  end
+
+  def test_default_two
+    assert_equal(
+      2.50000,
+      find_median_sorted_arrays(
+        [1, 2],
+        [3, 4]
+      )
+    )
+  end
+end