diff --git a/153. Find Minimum in Rotated Sorted Array/main.cpp b/153. Find Minimum in Rotated Sorted Array/main.cpp
new file mode 100644
index 0000000..b90e6f2
--- /dev/null
+++ b/153. Find Minimum in Rotated Sorted Array/main.cpp	
@@ -0,0 +1,19 @@
+/* You may assume no duplicate exists in the array. */
+#include <vector>
+using namespace std;
+class Solution {
+public:
+  int findMin(vector<int> &nums) {
+    auto left = nums.begin(), right = nums.end() - 1;
+    auto mid = left;
+    while (*left > *right) {
+      mid = (right - left) / 2 + left;
+      if (*mid < *left) {
+        right = mid;
+      } else {
+        left = mid + 1;
+      }
+    }
+    return *left;
+  }
+};