2025-01-15 v. 8.0.8: added "951. Flip Equivalent Binary Trees"

Author: fartem

README.md

@@ -644,6 +644,7 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 | 921. Minimum Add to Make Parentheses Valid                       | [Link](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid/)                       | [Link](./lib/medium/921_minimum_add_to_make_parentheses_valid.rb)                       | [Link](./test/medium/test_921_minimum_add_to_make_parentheses_valid.rb)                       |
 | 937. Reorder Data in Log Files                                   | [Link](https://leetcode.com/problems/reorder-data-in-log-files/)                                   | [Link](./lib/medium/937_reorder_data_in_log_files.rb)                                   | [Link](./test/medium/test_937_reorder_data_in_log_files.rb)                                   |
 | 946. Validate Stack Sequences                                    | [Link](https://leetcode.com/problems/validate-stack-sequences/)                                    | [Link](./lib/medium/946_validate_stack_sequences.rb)                                    | [Link](./test/medium/test_946_validate_stack_sequences.rb)                                    |
+| 951. Flip Equivalent Binary Trees                                | [Link](https://leetcode.com/problems/flip-equivalent-binary-trees/)                                | [Link](./lib/medium/951_flip_equivalent_binary_trees.rb)                                | [Link](./test/medium/test_951_flip_equivalent_binary_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)                 |
 | 2429. Minimize XOR                                               | [Link](https://leetcode.com/problems/minimize-xor/)                                                | [Link](./lib/medium/2429_minimize_xor.rb)                                               | [Link](./test/medium/test_2429_minimize_xor.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.0.7'
+  s.version = '8.0.8'
   s.license = 'MIT'
   s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
   s.executable = 'leetcode-ruby'

lib/medium/951_flip_equivalent_binary_trees.rb

@@ -0,0 +1,16 @@
+# frozen_string_literal: true
+
+# https://leetcode.com/problems/flip-equivalent-binary-trees/
+# @param {TreeNode} root1
+# @param {TreeNode} root2
+# @return {Boolean}
+def flip_equiv(root1, root2)
+  return true if root1 == root2
+
+  return false if !root1 || !root2 || root1.val != root2.val
+
+  original = flip_equiv(root1.right, root2.right) && flip_equiv(root1.left, root2.left)
+  switched = flip_equiv(root1.right, root2.left) && flip_equiv(root1.left, root2.right)
+
+  original || switched
+end

test/medium/test_951_flip_equivalent_binary_trees.rb

@@ -0,0 +1,60 @@
+# frozen_string_literal: true
+
+require_relative '../test_helper'
+require_relative '../../lib/common/binary_tree'
+require_relative '../../lib/medium/951_flip_equivalent_binary_trees'
+require 'minitest/autorun'
+
+class FlipEquivalentBinaryTreesTest < ::Minitest::Test
+  def test_default_one
+    assert(
+      flip_equiv(
+        ::TreeNode.new(
+          1,
+          ::TreeNode.new(
+            2,
+            ::TreeNode.new(4),
+            ::TreeNode.new(
+              5,
+              ::TreeNode.new(7),
+              ::TreeNode.new(8)
+            )
+          ),
+          ::TreeNode.new(
+            3,
+            ::TreeNode.new(6),
+            nil
+          )
+        ),
+        ::TreeNode.new(
+          1,
+          ::TreeNode.new(
+            3,
+            nil,
+            ::TreeNode.new(6)
+          ),
+          ::TreeNode.new(
+            2,
+            ::TreeNode.new(4),
+            ::TreeNode.new(
+              5,
+              ::TreeNode.new(8),
+              ::TreeNode.new(7)
+            )
+          )
+        )
+      )
+    )
+  end
+
+  def test_default_two = assert(flip_equiv(nil, nil))
+
+  def test_default_three
+    assert(
+      !flip_equiv(
+        nil,
+        ::TreeNode.new(1)
+      )
+    )
+  end
+end

test/test_helper.rb

@@ -8,6 +8,7 @@
 
   add_filter '706_design_hashmap'
   add_filter '33_search_in_rotated_sorted_array'
+  add_filter '951_flip_equivalent_binary_trees'
 
   minimum_coverage 100
 end