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

class Solution {
public:
    vector<int> searchRange(vector<int>& nums, int target) {
        vector<int> result = {-1, -1};
        
        // Find the leftmost occurrence
        int left = findLeft(nums, target);
        if (left == -1) {
            return result;
        }
        
        // Find the rightmost occurrence
        int right = findRight(nums, target);
        
        result[0] = left;
        result[1] = right;
        
        return result;
    }
    
    int findLeft(vector<int>& nums, int target) {
        int left = 0, right = nums.size() - 1;
        int leftmost = -1;
        
        while (left <= right) {
            int mid = left + (right - left) / 2;
            if (nums[mid] == target) {
                leftmost = mid;
                right = mid - 1;
            } else if (nums[mid] < target) {
                left = mid + 1;
            } else {
                right = mid - 1;
            }
        }
        
        return leftmost;
    }
    
    int findRight(vector<int>& nums, int target) {
        int left = 0, right = nums.size() - 1;
        int rightmost = -1;
        
        while (left <= right) {
            int mid = left + (right - left) / 2;
            if (nums[mid] == target) {
                rightmost = mid;
                left = mid + 1;
            } else if (nums[mid] < target) {
                left = mid + 1;
            } else {
                right = mid - 1;
            }
        }
        
        return rightmost;
    }
};