2024-10-07 v. 6.7.6: added "237. Delete Node in a Linked List"

README.md

@@ -541,3 +541,4 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 | 230. Kth Smallest Element in a BST                              | [Link](https://leetcode.com/problems/kth-smallest-element-in-a-bst/)                              | [Link](./lib/medium/230_kth_smallest_element_in_a_bst.rb)                              | [Link](./test/medium/test_230_kth_smallest_element_in_a_bst.rb)                              |
 | 235. Lowest Common Ancestor of a Binary Search Tree             | [Link](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/)             | [Link](./lib/medium/235_lowest_common_ancestor_of_a_binary_search_tree.rb)             | [Link](./test/medium/test_235_lowest_common_ancestor_of_a_binary_search_tree.rb)             |
 | 236. Lowest Common Ancestor of a Binary Tree                    | [Link](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/)                    | [Link](./lib/medium/236_lowest_common_ancestor_of_a_binary_tree.rb)                    | [Link](./test/medium/test_236_lowest_common_ancestor_of_a_binary_tree.rb)                    |
+| 237. Delete Node in a Linked List                               | [Link](https://leetcode.com/problems/delete-node-in-a-linked-list/)                               | [Link](./lib/medium/237_delete_node_in_a_linked_list.rb)                               | [Link](./test/medium/test_237_delete_node_in_a_linked_list.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.7.5'
+  s.version = '6.7.6'
   s.license = 'MIT'
   s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
   s.executable = 'leetcode-ruby'

lib/medium/237_delete_node_in_a_linked_list.rb

@@ -0,0 +1,9 @@
+# frozen_string_literal: true
+
+# https://leetcode.com/problems/delete-node-in-a-linked-list/
+# @param {ListNode} node
+# @return {Void} Do not return anything, modify node in-place instead.
+def delete_node(node)
+  node.val = node.next.val
+  node.next = node.next.next
+end

test/medium/test_237_delete_node_in_a_linked_list.rb

@@ -0,0 +1,40 @@
+# frozen_string_literal: true
+
+require_relative '../test_helper'
+require_relative '../../lib/common/linked_list'
+require_relative '../../lib/medium/237_delete_node_in_a_linked_list'
+require 'minitest/autorun'
+
+class DeleteNodeInALinkedListTest < ::Minitest::Test
+  def test_default_one
+    input = ::ListNode.from_array(
+      [4, 5, 1, 9]
+    )
+    delete_node(input.next)
+
+    assert(
+      ::ListNode.are_equals(
+        ::ListNode.from_array(
+          [4, 1, 9]
+        ),
+        input
+      )
+    )
+  end
+
+  def test_default_two
+    input = ::ListNode.from_array(
+      [4, 5, 1, 9]
+    )
+    delete_node(input.next.next)
+
+    assert(
+      ::ListNode.are_equals(
+        ::ListNode.from_array(
+          [4, 5, 9]
+        ),
+        input
+      )
+    )
+  end
+end