class Solution {
public:
    vector<int> searchRange(vector<int>& nums, int target) {
        int left = -1 ,right = -1;
        for(int i=0 , j=nums.size()-1 ; i<nums.size(); i++ ,j-- )
        {
            if(left == -1 && nums[i] == target ) left = i;
            if(right == -1 && nums[j] == target) right = j;
        } 
        return {left, right};
    }
};