2024-11-14 v. 7.0.3: added "429. N-ary Tree Level Order Traversal"

README.md

@@ -568,3 +568,4 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 | 402. Remove K Digits                                            | [Link](https://leetcode.com/problems/remove-k-digits/)                                            | [Link](./lib/medium/402_remove_k_digits.rb)                                            | [Link](./test/medium/test_402_remove_k_digits.rb)                                            |
 | 417. Pacific Atlantic Water Flow                                | [Link](https://leetcode.com/problems/pacific-atlantic-water-flow/)                                | [Link](./lib/medium/417_pacific_atlantic_water_flow.rb)                                | [Link](./test/medium/test_417_pacific_atlantic_water_flow.rb)                                |
 | 424. Longest Repeating Character Replacement                    | [Link](https://leetcode.com/problems/longest-repeating-character-replacement/)                    | [Link](./lib/medium/424_longest_repeating_character_replacement.rb)                    | [Link](./test/medium/test_424_longest_repeating_character_replacement.rb)                    |
+| 429. N-ary Tree Level Order Traversal                           | [Link](https://leetcode.com/problems/n-ary-tree-level-order-traversal/)                           | [Link](./lib/medium/429_n_ary_tree_level_order_traversal.rb)                           | [Link](./test/medium/test_429_n_ary_tree_level_order_traversal.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.0.2'
+  s.version = '7.0.3'
   s.license = 'MIT'
   s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
   s.executable = 'leetcode-ruby'

lib/medium/429_n_ary_tree_level_order_traversal.rb

@@ -0,0 +1,26 @@
+# frozen_string_literal: true
+
+# https://leetcode.com/problems/n-ary-tree-level-order-traversal/
+# @param {NAryNode} root
+# @return {List[List[int]]}
+def level_order429(root)
+  return [] unless root
+
+  result = []
+  queue = [root]
+  while queue.size.positive?
+    level = []
+    size = queue.size
+
+    (0...size).each do |_|
+      node = queue.delete_at(0)
+      level << node.val
+
+      node.children&.each { |child| queue << child }
+    end
+
+    result << level
+  end
+
+  result
+end

test/medium/test_429_n_ary_tree_level_order_traversal.rb

@@ -0,0 +1,100 @@
+# frozen_string_literal: true
+
+require_relative '../test_helper'
+require_relative '../../lib/common/n_ary_tree'
+require_relative '../../lib/medium/429_n_ary_tree_level_order_traversal'
+require 'minitest/autorun'
+
+class NAryTreeLevelOrderTraversalTest < ::Minitest::Test
+  def test_default_one
+    assert_equal(
+      [
+        [1],
+        [3, 2, 4],
+        [5, 6]
+      ],
+      level_order429(
+        ::NAryTree.new(
+          1,
+          [
+            ::NAryTree.new(
+              3,
+              [
+                ::NAryTree.new(5),
+                ::NAryTree.new(6)
+              ]
+            ),
+            ::NAryTree.new(2),
+            ::NAryTree.new(4)
+          ]
+        )
+      )
+    )
+  end
+
+  def test_default_two
+    assert_equal(
+      [
+        [1],
+        [2, 3, 4, 5],
+        [6, 7, 8, 9, 10],
+        [11, 12, 13],
+        [14]
+      ],
+      level_order429(
+        ::NAryTree.new(
+          1,
+          [
+            ::NAryTree.new(2),
+            ::NAryTree.new(
+              3,
+              [
+                ::NAryTree.new(6),
+                ::NAryTree.new(
+                  7,
+                  [
+                    ::NAryTree.new(
+                      11,
+                      [
+                        ::NAryTree.new(
+                          14
+                        )
+                      ]
+                    )
+                  ]
+                )
+              ]
+            ),
+            ::NAryTree.new(
+              4,
+              [
+                ::NAryTree.new(
+                  8,
+                  [
+                    ::NAryTree.new(
+                      12
+                    )
+                  ]
+                )
+              ]
+            ),
+            ::NAryTree.new(
+              5,
+              [
+                ::NAryTree.new(
+                  9,
+                  [
+                    ::NAryTree.new(
+                      13
+                    )
+                  ]
+                ),
+                ::NAryTree.new(10)
+              ]
+            )
+          ]
+        )
+      )
+    )
+  end
+end