2024-12-16 v. 7.3.4: added "623. Add One Row to Tree"

README.md

@@ -598,3 +598,4 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 | 609. Find Duplicate File in System                              | [Link](https://leetcode.com/problems/find-duplicate-file-in-system/)                              | [Link](./lib/medium/609_find_duplicate_file_in_system.rb)                              | [Link](./test/medium/test_609_find_duplicate_file_in_system.rb)                              |
 | 621. Task Scheduler                                             | [Link](https://leetcode.com/problems/task-scheduler/)                                             | [Link](./lib/medium/621_task_scheduler.rb)                                             | [Link](./test/medium/test_621_task_scheduler.rb)                                             |
 | 622. Design Circular Queue                                      | [Link](https://leetcode.com/problems/design-circular-queue/)                                      | [Link](./lib/medium/622_design_circular_queue.rb)                                      | [Link](./test/medium/test_622_design_circular_queue.rb)                                      |
+| 623. Add One Row to Tree                                        | [Link](https://leetcode.com/problems/add-one-row-to-tree/)                                        | [Link](./lib/medium/623_add_one_row_to_tree.rb)                                        | [Link](./test/medium/test_623_add_one_row_to_tree.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 = '7.3.3'
+  s.version = '7.3.4'
   s.license = 'MIT'
   s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
   s.executable = 'leetcode-ruby'

lib/medium/623_add_one_row_to_tree.rb

@@ -0,0 +1,42 @@
+# frozen_string_literal: true
+
+require_relative '../common/binary_tree'
+
+# https://leetcode.com/problems/add-one-row-to-tree/
+# @param {TreeNode} root
+# @param {Integer} val
+# @param {Integer} depth
+# @return {TreeNode}
+def add_one_row(root, val, depth)
+  return ::TreeNode.new(val, root, nil) if depth == 1
+
+  level = 1
+  nodes = [root]
+  until nodes.empty?
+    size = nodes.size
+
+    if (level + 1) == depth
+      until size.zero?
+        node = nodes.delete_at(0)
+        left = node.left
+        right = node.right
+        node.left = ::TreeNode.new(val, left, nil)
+        node.right = ::TreeNode.new(val, nil, right)
+
+        size -= 1
+      end
+    else
+      until size.zero?
+        node = nodes.delete_at(0)
+        nodes << node.left if node.left
+        nodes << node.right if node.right
+
+        size -= 1
+      end
+    end
+
+    level += 1
+  end
+
+  root
+end

test/medium/test_623_add_one_row_to_tree.rb

@@ -0,0 +1,90 @@
+# frozen_string_literal: true
+
+require_relative '../test_helper'
+require_relative '../../lib/common/binary_tree'
+require_relative '../../lib/medium/623_add_one_row_to_tree'
+require 'minitest/autorun'
+
+class AddOneRowToTreeTest < ::Minitest::Test
+  def test_default_one
+    assert(
+      ::TreeNode.are_equals(
+        ::TreeNode.new(
+          4,
+          ::TreeNode.new(
+            1,
+            ::TreeNode.new(
+              2,
+              ::TreeNode.new(3),
+              ::TreeNode.new(1)
+            ),
+            nil
+          ),
+          ::TreeNode.new(
+            1,
+            nil,
+            ::TreeNode.new(
+              6,
+              ::TreeNode.new(5),
+              nil
+            )
+          )
+        ),
+        add_one_row(
+          ::TreeNode.new(
+            4,
+            ::TreeNode.new(
+              2,
+              ::TreeNode.new(3),
+              ::TreeNode.new(1)
+            ),
+            ::TreeNode.new(
+              6,
+              ::TreeNode.new(5),
+              nil
+            )
+          ),
+          1,
+          2
+        )
+      )
+    )
+  end
+
+  def test_default_two
+    assert(
+      ::TreeNode.are_equals(
+        ::TreeNode.new(
+          4,
+          ::TreeNode.new(
+            2,
+            ::TreeNode.new(
+              1,
+              ::TreeNode.new(3),
+              nil
+            ),
+            ::TreeNode.new(
+              1,
+              nil,
+              ::TreeNode.new(1)
+            )
+          ),
+          nil
+        ),
+        add_one_row(
+          ::TreeNode.new(
+            4,
+            ::TreeNode.new(
+              2,
+              ::TreeNode.new(3),
+              ::TreeNode.new(1)
+            ),
+            nil
+          ),
+          1,
+          3
+        )
+      )
+    )
+  end
+end