From 086b1ec7d57de812ed82426bb6e73ed8118bf5dc Mon Sep 17 00:00:00 2001
From: fartem <jaman.smlnsk@gmail.com>
Date: Wed, 19 Feb 2025 07:19:12 +0300
Subject: [PATCH] 2025-02-19 v. 8.6.2: added "1457. Pseudo-Palindromic Paths in
 a Binary Tree"

---
 README.md                                     |  1 +
 leetcode-ruby.gemspec                         |  2 +-
 ...eudo_palindromic_paths_in_a_binary_tree.rb | 23 +++++++++++
 ...eudo_palindromic_paths_in_a_binary_tree.rb | 41 +++++++++++++++++++
 4 files changed, 66 insertions(+), 1 deletion(-)
 create mode 100644 lib/medium/1457_pseudo_palindromic_paths_in_a_binary_tree.rb
 create mode 100644 test/medium/test_1457_pseudo_palindromic_paths_in_a_binary_tree.rb

diff --git a/README.md b/README.md
index 87724abd..c142d903 100644
--- a/README.md
+++ b/README.md
@@ -695,6 +695,7 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 | 1433. Check If a String Can Break Another String                                    | [Link](https://leetcode.com/problems/check-if-a-string-can-break-another-string/)                                    | [Link](./lib/medium/1433_check_if_a_string_can_break_another_string.rb)                                    | [Link](./test/medium/test_1433_check_if_a_string_can_break_another_string.rb)                                    |
 | 1442. Count Triplets That Can Form Two Arrays of Equal XOR                          | [Link](https://leetcode.com/problems/count-triplets-that-can-form-two-arrays-of-equal-xor/)                          | [Link](./lib/medium/1442_count_triplets_that_can_form_two_arrays_of_equal_xor.rb)                          | [Link](./test/medium/test_1442_count_triplets_that_can_form_two_arrays_of_equal_xor.rb)                          |
 | 1448. Count Good Nodes in Binary Tree                                               | [Link](https://leetcode.com/problems/count-good-nodes-in-binary-tree/)                                               | [Link](./lib/medium/1448_count_good_nodes_in_binary_tree.rb)                                               | [Link](./test/medium/test_1448_count_good_nodes_in_binary_tree.rb)                                               |
+| 1457. Pseudo-Palindromic Paths in a Binary Tree                                     | [Link](https://leetcode.com/problems/pseudo-palindromic-paths-in-a-binary-tree/)                                     | [Link](./lib/medium/1457_pseudo_palindromic_paths_in_a_binary_tree.rb)                                     | [Link](./test/medium/test_1457_pseudo_palindromic_paths_in_a_binary_tree.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)                                                   |
 | 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)                                                                  |
diff --git a/leetcode-ruby.gemspec b/leetcode-ruby.gemspec
index 66ba3b25..4067ef3b 100644
--- a/leetcode-ruby.gemspec
+++ b/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.6.1'
+  s.version = '8.6.2'
   s.license = 'MIT'
   s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
   s.executable = 'leetcode-ruby'
diff --git a/lib/medium/1457_pseudo_palindromic_paths_in_a_binary_tree.rb b/lib/medium/1457_pseudo_palindromic_paths_in_a_binary_tree.rb
new file mode 100644
index 00000000..047e1a71
--- /dev/null
+++ b/lib/medium/1457_pseudo_palindromic_paths_in_a_binary_tree.rb
@@ -0,0 +1,23 @@
+# frozen_string_literal: true
+
+# https://leetcode.com/problems/pseudo-palindromic-paths-in-a-binary-tree/
+# @param {TreeNode} root
+# @return {Integer}
+def pseudo_palindromic_paths(root)
+  find_for_pseudo_palindromic_path(root, 0)
+end
+
+private
+
+# @param {TreeNode} root
+# @param {Integer} freq
+# @return {Integer}
+def find_for_pseudo_palindromic_path(node, freq)
+  return 0 unless node
+
+  freq = freq ^ (1 << node.val)
+
+  return (freq & (freq - 1)).zero? ? 1 : 0 if !node.left && !node.right
+
+  find_for_pseudo_palindromic_path(node.left, freq) + find_for_pseudo_palindromic_path(node.right, freq)
+end
diff --git a/test/medium/test_1457_pseudo_palindromic_paths_in_a_binary_tree.rb b/test/medium/test_1457_pseudo_palindromic_paths_in_a_binary_tree.rb
new file mode 100644
index 00000000..fa75b82e
--- /dev/null
+++ b/test/medium/test_1457_pseudo_palindromic_paths_in_a_binary_tree.rb
@@ -0,0 +1,41 @@
+# frozen_string_literal: true
+
+require_relative '../test_helper'
+require_relative '../../lib/common/binary_tree'
+require_relative '../../lib/medium/1457_pseudo_palindromic_paths_in_a_binary_tree'
+require 'minitest/autorun'
+
+class PseudoPalindromicPathsInABinaryTreeTest < ::Minitest::Test
+  def test_default_one
+    assert_equal(
+      2,
+      pseudo_palindromic_paths(
+        ::TreeNode.build_tree(
+          [2, 3, 1, 3, 1, nil, 1]
+        )
+      )
+    )
+  end
+
+  def test_default_two
+    assert_equal(
+      1,
+      pseudo_palindromic_paths(
+        ::TreeNode.build_tree(
+          [2, 1, 1, 1, 3, nil, nil, nil, nil, nil, 1]
+        )
+      )
+    )
+  end
+
+  def test_default_three
+    assert_equal(
+      1,
+      pseudo_palindromic_paths(
+        ::TreeNode.build_tree(
+          [9]
+        )
+      )
+    )
+  end
+end