2025-02-03 v. 8.3.9: added "1261. Find Elements in a Contaminated Binary Tree"

README.md

@@ -671,6 +671,7 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 | 1247. Minimum Swaps to Make Strings Equal                        | [Link](https://leetcode.com/problems/minimum-swaps-to-make-strings-equal/)                         | [Link](./lib/medium/1247_minimum_swaps_to_make_strings_equal.rb)                        | [Link](./test/medium/test_1247_minimum_swaps_to_make_strings_equal.rb)                        |
 | 1248. Count Number of Nice Subarrays                             | [Link](https://leetcode.com/problems/count-number-of-nice-subarrays/)                              | [Link](./lib/medium/1248_count_number_of_nice_subarrays.rb)                             | [Link](./test/medium/test_1248_count_number_of_nice_subarrays.rb)                             |
 | 1249. Minimum Remove to Make Valid Parentheses                   | [Link](https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/)                    | [Link](./lib/medium/1249_minimum_remove_to_make_valid_parentheses.rb)                   | [Link](./test/medium/test_1249_minimum_remove_to_make_valid_parentheses.rb)                   |
+| 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)                |
 | 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.3.8'
+  s.version = '8.3.9'
   s.license = 'MIT'
   s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
   s.executable = 'leetcode-ruby'

lib/medium/1261_find_elements_in_a_contaminated_binary_tree.rb

@@ -0,0 +1,39 @@
+# frozen_string_literal: true
+
+# https://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree/
+class FindElements
+  # @param {TreeNode} root
+  def initialize(root)
+    root.val = 0
+
+    @values = ::Set.new
+
+    recover(root)
+  end
+
+  # @param {Integer} target
+  # @return {Boolean}
+  def find(target) = @values.include?(target)
+
+  private
+
+  # @param {TreeNode} node
+  # @return {Void}
+  def recover(node)
+    return unless node
+
+    @values << node.val
+
+    if node.left
+      node.left.val = 2 * node.val + 1
+
+      recover(node.left)
+    end
+
+    return unless node.right
+
+    node.right.val = 2 * node.val + 2
+
+    recover(node.right)
+  end
+end

test/medium/test_1261_find_elements_in_a_contaminated_binary_tree.rb

@@ -0,0 +1,44 @@
+# frozen_string_literal: true
+
+require_relative '../test_helper'
+require_relative '../../lib/common/binary_tree'
+require_relative '../../lib/medium/1261_find_elements_in_a_contaminated_binary_tree'
+require 'minitest/autorun'
+
+class FindElementsInAContaminatedBinaryTreeTest < ::Minitest::Test
+  def test_case_one
+    find_elements = ::FindElements.new(
+      ::TreeNode.build_tree(
+        [-1, nil, -1]
+      )
+    )
+
+    assert(!find_elements.find(1))
+    assert(find_elements.find(2))
+  end
+
+  def test_case_two
+    find_elements = ::FindElements.new(
+      ::TreeNode.build_tree(
+        [-1, -1, -1, -1, -1]
+      )
+    )
+
+    assert(find_elements.find(1))
+    assert(find_elements.find(3))
+    assert(!find_elements.find(5))
+  end
+
+  def test_case_three
+    find_elements = ::FindElements.new(
+      ::TreeNode.build_tree(
+        [-1, nil, -1, -1, nil, -1]
+      )
+    )
+
+    assert(find_elements.find(2))
+    assert(!find_elements.find(3))
+    assert(!find_elements.find(4))
+    assert(find_elements.find(5))
+  end
+end