34. Find First and Last Position of Element in Sorted Array Leetcode Solution

class Solution {
public:
    vector< int> searchRange(vector< int>& nums, int target) {

        if(binary_search(nums.begin(),nums.end(),target))
        {
            int idx=lower_bound(nums.begin(),nums.end(),target)-nums.begin();
            int idx1=upper_bound(nums.begin(),nums.end(),target)-nums.begin();
            return {idx,idx1-1};
        }
        return {-1,-1};
        
    }
};

class Solution {
   
    public int[] searchRange(int[] nums, int target) {
        int first = -1, last = -1;
        for(int i=0;i< nums.length;i++){
            if(nums[i] == target){
                if(first == -1){
                    first = i;
                }
                last = i;
            }
        }
        return new int[]{first, last};
    }
}

class Solution:
    def searchRange(self, nums: List[int], target: int) -> List[int]:
        left = 0
        right = len(nums)-1
        l = []
        while left < len(nums):
            if nums[left]==target:
                l.append(left)
                break
            left +=1
        while right >=0:
            if nums[right]==target:
                l.append(right)
                break
            right -=1  
        if len(l) ==0:
            return [-1,-1]
        else:
            return l