2024-08-16 v. 6.4.9: added "133. Clone Graph"

README.md

@@ -514,3 +514,4 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 | 120. Triangle                                                   | [Link](https://leetcode.com/problems/triangle/)                                                   | [Link](./lib/medium/120_triangle.rb)                                                   |
 | 128. Longest Consecutive Sequence                               | [Link](https://leetcode.com/problems/longest-consecutive-sequence/)                               | [Link](./lib/medium/128_longest_consecutive_sequence.rb)                               |
 | 129. Sum Root to Leaf Numbers                                   | [Link](https://leetcode.com/problems/sum-root-to-leaf-numbers/)                                   | [Link](./lib/medium/129_sum_root_to_leaf_numbers.rb)                                   |
+| 133. Clone Graph                                                | [Link](https://leetcode.com/problems/clone-graph/)                                                | [Link](./lib/medium/133_clone_graph.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 = '6.4.8'
+  s.version = '6.4.9'
   s.license = 'MIT'
   s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
   s.executable = 'leetcode-ruby'

lib/common/node_with_neighbors.rb

@@ -0,0 +1,32 @@
+# frozen_string_literal: true
+
+# NodeWithNeighbors implementation for this project
+class NodeWithNeighbors
+  attr_accessor :val, :neighbors
+
+  # @param {Integer} val
+  # @param {Array} neighbors
+  def initialize(val, neighbors = nil)
+    @val = val
+    @neighbors = neighbors.nil? ? [] : neighbors
+  end
+
+  # @param {NodeWithNeighbors} n1
+  # @param {NodeWithNeighbors} n2
+  # @return {Boolean}
+  def self.are_equals(n1, n2)
+    if !n1.nil? && !n2.nil?
+      return false unless n1.val == n2.val
+
+      return false unless n1.neighbors.size == n2.neighbors.size
+
+      n1.neighbors.each_with_index do |neighbor, index|
+        return false unless neighbor.val == n2.neighbors[index].val
+      end
+
+      return true
+    end
+
+    n1.nil? && n2.nil?
+  end
+end

lib/medium/133_clone_graph.rb

@@ -0,0 +1,29 @@
+# frozen_string_literal: true
+
+require_relative '../common/node_with_neighbors'
+
+# https://leetcode.com/problems/clone-graph/
+# @param {NodeWithNeighbors} node
+# @return {NodeWithNeighbors}
+def clone_graph(node)
+  clone_graph_rec(node, {})
+end
+
+private
+
+# @param {NodeWithNeighbors} node
+# @param {Hash} values
+# @param {NodeWithNeighbors} values
+def clone_graph_rec(node, values)
+  return unless node
+
+  return values[node] if values.key?(node)
+
+  root = ::NodeWithNeighbors.new(node.val, [])
+  values[node] = root
+  node.neighbors.each do |neighbor|
+    root.neighbors << clone_graph_rec(neighbor, values)
+  end
+
+  root
+end

test/medium/test_133_clone_graph.rb

@@ -0,0 +1,45 @@
+# frozen_string_literal: true
+
+require_relative '../test_helper'
+require_relative '../../lib/common/node_with_neighbors'
+require_relative '../../lib/medium/133_clone_graph'
+require 'minitest/autorun'
+
+class CloneGraphTest < ::Minitest::Test
+  def test_default
+    g1 = ::NodeWithNeighbors.new(1)
+    g2 = ::NodeWithNeighbors.new(2)
+    g3 = ::NodeWithNeighbors.new(3)
+    g4 = ::NodeWithNeighbors.new(4)
+    g1.neighbors << g2
+    g1.neighbors << g4
+    g2.neighbors << g1
+    g2.neighbors << g3
+    g3.neighbors << g2
+    g3.neighbors << g4
+    g4.neighbors << g1
+    g4.neighbors << g4
+
+    assert(
+      ::NodeWithNeighbors.are_equals(
+        g1,
+        clone_graph(g1)
+      )
+    )
+
+    g5 = ::NodeWithNeighbors.new(1)
+    assert(
+      ::NodeWithNeighbors.are_equals(
+        g5,
+        clone_graph(g5)
+      )
+    )
+
+    assert(
+      ::NodeWithNeighbors.are_equals(
+        nil,
+        clone_graph(nil)
+      )
+    )
+  end
+end