added Find Minimum in Rotated Sorted Array (Medium)

Author: minhyeong-joe

Medium/FindMinInRotatedSortedArray/README.md

@@ -0,0 +1,24 @@
+
+# Find Minimum in Rotated Sorted Array
+[Leetcode Link](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/)
+
+## Problem:
+
+Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
+
+(i.e., `[0,1,2,4,5,6,7]` might become `[4,5,6,7,0,1,2]`).
+
+Find the minimum element.
+
+You may assume no duplicate exists in the array.
+
+## Example:
+
+```
+Input: [3,4,5,1,2] 
+Output: 1
+```
+```
+Input: [4,5,6,7,0,1,2]
+Output: 0
+```

Medium/FindMinInRotatedSortedArray/solution.py

@@ -0,0 +1,16 @@
+from typing import List
+
+class Solution:
+ def findMin(self, nums: List[int]) -> int:
+ for i in range(len(nums)):
+ j = i+1 if i < len(nums)-1 else 0
+ if nums[i] >= nums[j]:
+ return nums[j]
+
+
+
+# test driver
+sol = Solution()
+nums = [3,4,5,1,2]
+print("Input:", nums)
+print("Output:", sol.findMin(nums))

README.md

@@ -69,6 +69,7 @@ Languages used: Java and Python
  - [Surrounded Regions](Medium/SurroundedRegions)
  - [Predict the Winner](Medium/PredictWinner)
  - [Subarray Sum Equals K](Medium/SubarraySumEqualsK)
+ - [Find Minimum in Rotated Sorted Array](Medium/FindMinInRotatedSortedArray)
 - Hard
  - [Maximum Score Words Formed by Letters](Hard/MaximumScoreWords)
  - [Reducing Dishes](Hard/ReducingDishes)