2025-02-12 v. 8.5.2: added "1367. Linked List in Binary Tree"

README.md

@@ -684,6 +684,7 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 | 1343. Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold | [Link](https://leetcode.com/problems/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold/) | [Link](./lib/medium/1343_number_of_sub_arrays_of_size_k_and_average_greater_than_or_equal_to_threshold.rb) | [Link](./test/medium/test_1343_number_of_sub_arrays_of_size_k_and_average_greater_than_or_equal_to_threshold.rb) |
 | 1347. Minimum Number of Steps to Make Two Strings Anagram                           | [Link](https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram/)                           | [Link](./lib/medium/1347_minimum_number_of_steps_to_make_two_strings_anagram.rb)                           | [Link](./test/medium/test_1347_minimum_number_of_steps_to_make_two_strings_anagram.rb)                           |
 | 1358. Number of Substrings Containing All Three Characters                          | [Link](https://leetcode.com/problems/number-of-substrings-containing-all-three-characters/)                          | [Link](./lib/medium/1358_number_of_substrings_containing_all_three_characters.rb)                          | [Link](./test/medium/test_1358_number_of_substrings_containing_all_three_characters.rb)                          |
+| 1367. Linked List in Binary Tree                                                    | [Link](https://leetcode.com/problems/linked-list-in-binary-tree/)                                                    | [Link](./lib/medium/1367_linked_list_in_binary_tree.rb)                                                    | [Link](./test/medium/test_1367_linked_list_in_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.5.1'
+  s.version = '8.5.2'
   s.license = 'MIT'
   s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
   s.executable = 'leetcode-ruby'

lib/medium/1367_linked_list_in_binary_tree.rb

@@ -0,0 +1,36 @@
+# frozen_string_literal: true
+
+# https://leetcode.com/problems/linked-list-in-binary-tree/
+# @param {ListNode} head
+# @param {TreeNode} root
+# @return {Boolean}
+def is_sub_path(head, root)
+  nodes = [root]
+
+  until nodes.empty?
+    node = nodes.shift
+
+    return true if node.val == head.val && dfs_for_sub_path(head, node)
+
+    nodes << node.left if node.left
+    nodes << node.right if node.right
+  end
+
+  false
+end
+
+private
+
+# @param {ListNode} head
+# @param {TreeNode} root
+# @return {Boolean}
+def dfs_for_sub_path(head, root)
+  return true unless head
+
+  return false if root.nil? || root.val != head.val
+
+  left = dfs_for_sub_path(head.next, root.left)
+  right = dfs_for_sub_path(head.next, root.right)
+
+  left || right
+end

test/medium/test_1367_linked_list_in_binary_tree.rb

@@ -0,0 +1,48 @@
+# frozen_string_literal: true
+
+require_relative '../test_helper'
+require_relative '../../lib/common/binary_tree'
+require_relative '../../lib/common/linked_list'
+require_relative '../../lib/medium/1367_linked_list_in_binary_tree'
+require 'minitest/autorun'
+
+class LinkedListInBinaryTreeTest < ::Minitest::Test
+  def test_default_one
+    assert(
+      is_sub_path(
+        ::ListNode.from_array(
+          [4, 2, 8]
+        ),
+        ::TreeNode.build_tree(
+          [1, 4, 4, nil, 2, 2, nil, 1, nil, 6, 8, nil, nil, nil, nil, 1, 3]
+        )
+      )
+    )
+  end
+
+  def test_default_two
+    assert(
+      is_sub_path(
+        ::ListNode.from_array(
+          [1, 4, 2, 6]
+        ),
+        ::TreeNode.build_tree(
+          [1, 4, 4, nil, 2, 2, nil, 1, nil, 6, 8, nil, nil, nil, nil, 1, 3]
+        )
+      )
+    )
+  end
+
+  def test_default_three
+    assert(
+      !is_sub_path(
+        ::ListNode.from_array(
+          [1, 4, 2, 6, 8]
+        ),
+        ::TreeNode.build_tree(
+          [1, 4, 4, nil, 2, 2, nil, 1, nil, 6, 8, nil, nil, nil, nil, 1, 3]
+        )
+      )
+    )
+  end
+end