## Posts

### Week 6 Coding period GSOC 2021 LibreHealth

Week 6 Coding period GSOC 2021 LibreHealth- Hey, Reader's we are in the 6th week of the coding period. The 6th week started on 9th July. This week I started working on the Cost of care web application.  What progress have you made this week- In the 6th week of the coding period, I have done the following thing with the cost of care web application. 1-added overpass API. 2- Display overpass API result like hospital name, distance, and no of beds available same as flutter application. This week I was busy with college work. That's why I did less work as compared to the previous week. My plan for next week- I have planned to do the following task for week 7 1-Improve Home screen UI. 2-I will send 1 merge request to cost of care web app project.  I started working with the cost of care web react application  I am enjoying working with this project. see you next week.

### Find Minimum in Rotated Sorted Array II

Find Minimum in Rotated Sorted Array II- Suppose an array of length  n  sorted in ascending order is  rotated  between  1  and  n  times. For example, the array  nums = [0,1,4,4,5,6,7]  might become: [4,5,6,7,0,1,4]  if it was rotated  4  times. [0,1,4,4,5,6,7]  if it was rotated  7  times. Notice that  rotating  an array  [a[0], a[1], a[2], ..., a[n-1]]  1 time results in the array  [a[n-1], a[0], a[1], a[2], ..., a[n-2]] . Given the sorted rotated array  nums  that may contain  duplicates , return  the minimum element of this array . You must decrease the overall operation steps as much as possible.   Example 1: Input: nums = [1,3,5] Output: 1 Example 2: Input: nums = [2,2,2,0,1] Output: 0   Constraints: n == nums.length 1 <= n <= 5000 -5000 <= nums[i] <= 5000 nums  is sorted and rotated between  1  and  n  times.   Follow up:  This problem is similar to  Find Minimum in Rotated Sorted Array , but  nums  may contain  duplicates . Would this affect the runtime comple