2025-01-28 v. 8.3.0: added "1110. Delete Nodes And Return Forest"

README.md

@@ -662,6 +662,7 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 | 1043. Partition Array for Maximum Sum                            | [Link](https://leetcode.com/problems/partition-array-for-maximum-sum/)                             | [Link](./lib/medium/1043_partition_array_for_maximum_sum.rb)                            | [Link](./test/medium/test_1043_partition_array_for_maximum_sum.rb)                            |
 | 1079. Letter Tile Possibilities                                  | [Link](https://leetcode.com/problems/letter-tile-possibilities/)                                   | [Link](./lib/medium/1079_letter_tile_possibilities.rb)                                  | [Link](./test/medium/test_1079_letter_tile_possibilities.rb)                                  |
 | 1081. Smallest Subsequence of Distinct Characters                | [Link](https://leetcode.com/problems/smallest-subsequence-of-distinct-characters/)                 | [Link](./lib/medium/1081_smallest_subsequence_of_distinct_characters.rb)                | [Link](./test/medium/test_1081_smallest_subsequence_of_distinct_characters.rb)                |
+| 1110. Delete Nodes And Return Forest                             | [Link](https://leetcode.com/problems/delete-nodes-and-return-forest/)                              | [Link](./lib/medium/1110_delete_nodes_and_return_forest.rb)                             | [Link](./test/medium/test_1110_delete_nodes_and_return_forest.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.2.9'
+  s.version = '8.3.0'
   s.license = 'MIT'
   s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
   s.executable = 'leetcode-ruby'

lib/medium/1110_delete_nodes_and_return_forest.rb

@@ -0,0 +1,40 @@
+# frozen_string_literal: true
+
+require 'set'
+
+# https://leetcode.com/problems/delete-nodes-and-return-forest/
+# @param {TreeNode} root
+# @param {Integer[]} to_delete
+# @return {TreeNode[]}
+def del_nodes(root, to_delete)
+  delete_values = to_delete.to_set
+  result = []
+
+  node = collect_nodes(root, result, delete_values)
+
+  result << root if node
+
+  result
+end
+
+private
+
+# @param {TreeNode} node
+# @param {TreeNode[]} nodes
+# @param {Integer{}} delete_values
+# @return {TreeNode}
+def collect_nodes(node, nodes, delete_values)
+  return if node.nil?
+
+  node.left = collect_nodes(node.left, nodes, delete_values)
+  node.right = collect_nodes(node.right, nodes, delete_values)
+
+  if delete_values.include?(node.val)
+    nodes << node.left if node.left
+    nodes << node.right if node.right
+
+    return
+  end
+
+  node
+end

test/medium/test_1110_delete_nodes_and_return_forest.rb

@@ -0,0 +1,58 @@
+# frozen_string_literal: true
+
+require_relative '../test_helper'
+require_relative '../../lib/common/binary_tree'
+require_relative '../../lib/medium/1110_delete_nodes_and_return_forest'
+require 'minitest/autorun'
+
+class DeleteNodesAndReturnForestTest < ::Minitest::Test
+  def test_default_one
+    result = del_nodes(
+      ::TreeNode.build_tree(
+        [1, 2, 3, 4, 5, 6, 7]
+      ),
+      [3, 5]
+    )
+
+    [
+      ::TreeNode.build_tree(
+        [6]
+      ),
+      ::TreeNode.build_tree(
+        [7]
+      ),
+      ::TreeNode.build_tree(
+        [1, 2, nil, 4]
+      )
+    ].each_with_index do |tree, index|
+      assert(
+        ::TreeNode.are_equals(
+          result[index],
+          tree
+        )
+      )
+    end
+  end
+
+  def test_default_two
+    result = del_nodes(
+      ::TreeNode.build_tree(
+        [1, 2, 4, nil, 3]
+      ),
+      [3]
+    )
+
+    [
+      ::TreeNode.build_tree(
+        [1, 2, 4]
+      )
+    ].each_with_index do |tree, index|
+      assert(
+        ::TreeNode.are_equals(
+          result[index],
+          tree
+        )
+      )
+    end
+  end
+end