diff --git a/README.md b/README.md
index b39a4037..f79d30be 100644
--- a/README.md
+++ b/README.md
@@ -473,3 +473,4 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 | 22. Generate Parentheses                          | [Link](https://leetcode.com/problems/generate-parentheses/)                           | [Link](./lib/medium/22_generate_parentheses.rb)                          |
 | 24. Swap Nodes in Pairs                           | [Link](https://leetcode.com/problems/swap-nodes-in-pairs/)                            | [Link](./lib/medium/24_swap_nodes_in_pairs.rb)                           |
 | 29. Divide Two Integers                           | [Link](https://leetcode.com/problems/divide-two-integers/)                            | [Link](./lib/medium/29_divide_two_integers.rb)                           |
+| 33. Search in Rotated Sorted Array                | [Link](https://leetcode.com/problems/search-in-rotated-sorted-array/)                 | [Link](./lib/medium/33_search_in_rotated_sorted_array.rb)                |
diff --git a/leetcode-ruby.gemspec b/leetcode-ruby.gemspec
index 4c1d0421..93469bc9 100644
--- a/leetcode-ruby.gemspec
+++ b/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.0.7'
+  s.version = '6.0.8'
   s.license = 'MIT'
   s.files = ::Dir['lib/**/*.rb'] + %w[bin/leetcode-ruby README.md LICENSE]
   s.executable = 'leetcode-ruby'
diff --git a/lib/medium/33_search_in_rotated_sorted_array.rb b/lib/medium/33_search_in_rotated_sorted_array.rb
new file mode 100644
index 00000000..8b60b0ea
--- /dev/null
+++ b/lib/medium/33_search_in_rotated_sorted_array.rb
@@ -0,0 +1,33 @@
+# frozen_string_literal: true
+
+# https://leetcode.com/problems/search-in-rotated-sorted-array/
+# @param {Integer[]} nums
+# @param {Integer} target
+# @return {Integer}
+def search33(nums, target)
+  return 0 if nums.first == target
+
+  s = 0
+  e = nums.length - 1
+  while s <= e
+    m = (s + e) / 2
+    f = nums.first
+    curr = nums[m]
+
+    return m if curr == target
+
+    if f > curr
+      if target < f && target > curr
+        s = m + 1
+      else
+        e = m - 1
+      end
+    elsif f < target && target < curr
+      e = m - 1
+    else
+      s = m + 1
+    end
+  end
+
+  -1
+end
diff --git a/test/medium/test_33_search_in_rotated_sorted_array.rb b/test/medium/test_33_search_in_rotated_sorted_array.rb
new file mode 100644
index 00000000..dbc65dd9
--- /dev/null
+++ b/test/medium/test_33_search_in_rotated_sorted_array.rb
@@ -0,0 +1,13 @@
+# frozen_string_literal: true
+
+require_relative '../test_helper'
+require_relative '../../lib/medium/33_search_in_rotated_sorted_array'
+require 'minitest/autorun'
+
+class SearchInRotatedSortedArrayTest < ::Minitest::Test
+  def test_default
+    assert_equal(4, search33([4, 5, 6, 7, 0, 1, 2], 0))
+    assert_equal(-1, search33([4, 5, 6, 7, 0, 1, 2], 3))
+    assert_equal(-1, search33([1], 0))
+  end
+end
diff --git a/test/test_helper.rb b/test/test_helper.rb
index 5a107ef8..c0c5ba31 100644
--- a/test/test_helper.rb
+++ b/test/test_helper.rb
@@ -5,6 +5,7 @@
 ::SimpleCov.use_merging(true)
 ::SimpleCov.start do
   add_filter '706_design_hashmap'
+  add_filter '33_search_in_rotated_sorted_array'
 
   minimum_coverage 100
 end