2025-01-23 v. 8.2.5.9: updated tests

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.2.5.8'
+  s.version = '8.2.5.9'
   s.license = 'MIT'
   s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
   s.executable = 'leetcode-ruby'

lib/medium/33_search_in_rotated_sorted_array.rb

@@ -4,11 +4,12 @@
 # @param {Integer[]} nums
 # @param {Integer} target
 # @return {Integer}
-def search33(nums, target)
+def search_in_rotated_sorted_array(nums, target)
   return 0 if nums.first == target
 
   s = 0
   e = nums.length - 1
+
   while s <= e
     m = (s + e) / 2
     f = nums.first

test/medium/test_33_search_in_rotated_sorted_array.rb

@@ -8,7 +8,7 @@ class SearchInRotatedSortedArrayTest < ::Minitest::Test
   def test_default_one
     assert_equal(
       4,
-      search33(
+      search_in_rotated_sorted_array(
         [4, 5, 6, 7, 0, 1, 2],
         0
       )
@@ -18,7 +18,7 @@ def test_default_one
   def test_default_two
     assert_equal(
       -1,
-      search33(
+      search_in_rotated_sorted_array(
         [4, 5, 6, 7, 0, 1, 2],
         3
       )
@@ -28,10 +28,20 @@ def test_default_two
   def test_default_three
     assert_equal(
       -1,
-      search33(
+      search_in_rotated_sorted_array(
         [1],
         0
       )
     )
   end
+
+  def test_additional_one
+    assert_equal(
+      -1,
+      search_in_rotated_sorted_array(
+        [1, 3],
+        2
+      )
+    )
+  end
 end

test/medium/test_34_find_first_and_last_position_of_element_in_sorted_array.rb

@@ -4,7 +4,7 @@
 require_relative '../../lib/medium/34_find_first_and_last_position_of_element_in_sorted_array'
 require 'minitest/autorun'
 
-class SearchInRotatedSortedArrayTest < ::Minitest::Test
+class FindFirstAndLastPositionOfElementInSortedArrayTest < ::Minitest::Test
   def test_default_one
     assert_equal(
       [3, 4],

test/test_helper.rb

@@ -7,7 +7,6 @@
   add_filter 'next_tree_node'
 
   add_filter '706_design_hashmap'
-  add_filter '33_search_in_rotated_sorted_array'
   add_filter '951_flip_equivalent_binary_trees'
 
   minimum_coverage 100