<p>Given an array of integers <code>nums</code> sorted in non-decreasing order, find the starting and ending position of a given <code>target</code> value.</p>

<p>If <code>target</code> is not found in the array, return <code>[-1, -1]</code>.</p>

<p>You must&nbsp;write an algorithm with&nbsp;<code>O(log n)</code> runtime complexity.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<pre><strong>Input:</strong> nums = [5,7,7,8,8,10], target = 8
<strong>Output:</strong> [3,4]
</pre><p><strong class="example">Example 2:</strong></p>
<pre><strong>Input:</strong> nums = [5,7,7,8,8,10], target = 6
<strong>Output:</strong> [-1,-1]
</pre><p><strong class="example">Example 3:</strong></p>
<pre><strong>Input:</strong> nums = [], target = 0
<strong>Output:</strong> [-1,-1]
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>0 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
	<li><code>-10<sup>9</sup>&nbsp;&lt;= nums[i]&nbsp;&lt;= 10<sup>9</sup></code></li>
	<li><code>nums</code> is a non-decreasing array.</li>
	<li><code>-10<sup>9</sup>&nbsp;&lt;= target&nbsp;&lt;= 10<sup>9</sup></code></li>
</ul>

class Solution:
    def searchRange(self, nums: List[int], target: int) -> List[int]:
        st = 0
        end = len(nums)-1
        ans = [-1,-1]
        while(st<=end):
            mid = st+(end-st)//2
            if nums[mid] == target:
                ans[0] = self.extreme(nums, target, mid)
                ans[1] = self.extreme(nums, target, mid, 1)
                return ans
            elif target<nums[mid]:
                    end = mid-1
            else:
                st = mid+1 
        return ans
        
    def extreme(self, nums, target, mid, flag=0):
        if flag == 0:
            st = 0
            end = mid-1
            ans = mid
            while st<=end:
                mid = st+(end-st)//2
                if target==nums[mid]:
                    ans = min(mid, ans)
                    end = mid-1
                elif target<nums[mid]:
                    end = mid-1
                else:
                    st = mid+1
            return ans
        else:
            st = mid+1
            end = len(nums)-1
            ans = mid
            while st<=end:
                mid = st+(end-st)//2
                if target==nums[mid]:
                    ans = max(mid, ans)
                    st = mid+1
                elif target<nums[mid]:
                    end = mid-1
                else:
                    st = mid+1
            return ans
        
        
17400