diff --git a/153-find-minimum-in-rotated-sorted-array/153-find-minimum-in-rotated-sorted-array.cpp b/153-find-minimum-in-rotated-sorted-array/153-find-minimum-in-rotated-sorted-array.cpp
new file mode 100644
index 00000000..23446ef9
--- /dev/null
+++ b/153-find-minimum-in-rotated-sorted-array/153-find-minimum-in-rotated-sorted-array.cpp
@@ -0,0 +1,19 @@
+class Solution {
+public:
+    int findMin(vector<int>& nums) {
+        int n=nums.size();
+        
+        int lo=0, hi=n-1;
+        
+        while(lo<hi){
+            int mid=lo+(hi-lo)/2;
+            
+            if(nums[mid]>nums[hi])
+                lo=mid+1;
+            
+            else hi=mid;
+        }
+        
+        return nums[hi];
+    }
+};
\ No newline at end of file