🐎 Day 20

Author: AkashRajpurohit

README.md

@@ -28,6 +28,7 @@
 3. [Mirror Reflection](https://leetcode.com/explore/challenge/card/november-leetcoding-challenge/566/week-3-november-15th-november-21st/3534/) ➡️ [CPP Solution](Week3/mirrorReflection.cpp)
 4. [Merge Intervals](https://leetcode.com/explore/challenge/card/november-leetcoding-challenge/566/week-3-november-15th-november-21st/3535/) ➡️ [CPP Solution](Week3/merge.cpp)
 5. [Decode String](https://leetcode.com/explore/challenge/card/november-leetcoding-challenge/566/week-3-november-15th-november-21st/3536/) ➡️ [CPP Solution](Week3/decodeString.cpp)
+6. [Search in Rotated Sorted Array II](https://leetcode.com/explore/challenge/card/november-leetcoding-challenge/566/week-3-november-15th-november-21st/3537/) ➡️ [CPP Solution](Week3/search.cpp)
 
 ## Week 4 🚧
 Coming soon...

Week3/search.cpp

@@ -0,0 +1,43 @@
+class Solution {
+public:
+    bool search(vector<int>& nums, int target) {
+        int n = nums.size();
+        if(n == 0) return false;
+        
+        int low = 0, high = n - 1, mid, first = nums[0];
+        
+        while(low <= high) {
+            
+            while(low < high && nums[low] == nums[low + 1])
+                low++;
+            
+            while(low < high && nums[high] == nums[high - 1])
+                high--;
+            
+            
+            mid = low + (high - low) / 2;
+            int value = nums[mid];
+            
+            if(value == target) return true;
+            
+            bool am_big = value >= first;
+            bool target_big = target >= first;
+            
+            if(am_big == target_big) {
+                if(value < target) {
+                    low = mid + 1;
+                } else {
+                    high = mid - 1;
+                }
+            } else {
+                if(am_big) {
+                    low = mid + 1;
+                } else {
+                    high = mid - 1;
+                }
+            }
+        }
+        
+        return false;
+    }
+};