2025-02-05 v. 8.4.2: added "1305. All Elements in Two Binary Search Trees"

README.md

@@ -674,6 +674,7 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 | 1261. Find Elements in a Contaminated Binary Tree                | [Link](https://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree/)                 | [Link](./lib/medium/1261_find_elements_in_a_contaminated_binary_tree.rb)                | [Link](./test/medium/test_1261_find_elements_in_a_contaminated_binary_tree.rb)                |
 | 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)                    |
 | 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)                                |

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

lib/medium/1305_all_elements_in_two_binary_search_trees.rb

@@ -0,0 +1,65 @@
+# frozen_string_literal: true
+
+# https://leetcode.com/problems/all-elements-in-two-binary-search-trees/
+# @param {TreeNode} root1
+# @param {TreeNode} root2
+# @return {Integer[]}
+def get_all_elements(root1, root2)
+  first = []
+  traverse_for_get_all_elements(root1, first)
+
+  second = []
+  traverse_for_get_all_elements(root2, second)
+
+  merge_for_get_all_elements(first, second)
+end
+
+private
+
+# @param {TreeNode} node
+# @param {Integer[]} values
+# @return {Integer[]}
+def traverse_for_get_all_elements(node, values)
+  return unless node
+
+  traverse_for_get_all_elements(node.left, values)
+  values << node.val
+  traverse_for_get_all_elements(node.right, values)
+end
+
+# @param {Integer[]} first
+# @param {Integer[]} second
+# @return {Integer[]}
+def merge_for_get_all_elements(first, second)
+  result = []
+
+  i = 0
+  j = 0
+
+  while i < first.size || j < second.size
+    if i >= first.size
+      result.concat(second[j..])
+
+      break
+    elsif j >= second.size
+      result.concat(first[i..])
+
+      break
+    end
+
+    a = first[i]
+    b = second[j]
+
+    if a < b
+      result << a
+
+      i += 1
+    else
+      result << b
+
+      j += 1
+    end
+  end
+
+  result
+end

test/medium/test_1305_all_elements_in_two_binary_search_trees.rb

@@ -0,0 +1,50 @@
+# frozen_string_literal: true
+
+require_relative '../test_helper'
+require_relative '../../lib/common/binary_tree'
+require_relative '../../lib/medium/1305_all_elements_in_two_binary_search_trees'
+require 'minitest/autorun'
+
+class AllElementsInTwoBinarySearchTreesTest < ::Minitest::Test
+  def test_default_one
+    assert_equal(
+      [0, 1, 1, 2, 3, 4],
+      get_all_elements(
+        ::TreeNode.build_tree(
+          [2, 1, 4]
+        ),
+        ::TreeNode.build_tree(
+          [1, 0, 3]
+        )
+      )
+    )
+  end
+
+  def test_default_two
+    assert_equal(
+      [1, 1, 8, 8],
+      get_all_elements(
+        ::TreeNode.build_tree(
+          [1, nil, 8]
+        ),
+        ::TreeNode.build_tree(
+          [8, 1]
+        )
+      )
+    )
+  end
+
+  def test_additional_one
+    assert_equal(
+      [0, 1, 2, 5, 7],
+      get_all_elements(
+        ::TreeNode.build_tree(
+          []
+        ),
+        ::TreeNode.build_tree(
+          [5, 1, 7, 0, 2]
+        )
+      )
+    )
+  end
+end