code

class Solution:
    def searchRange(self, nums: List[int], target: int) -> List[int]:
        small_value, big_value = -1, -1
        left, right = 0, len(nums) - 1

        while left <= right:
            middle = (left + right) // 2
            if nums[middle] < target:
                left = middle + 1
            if nums[middle] > target:
                right = middle - 1
            if nums[middle] == target:
                small_value = middle
                big_value = middle
                break

        left_pointer, right_pointer = small_value, big_value

        while left_pointer >= 0 and nums[left_pointer] == target:
            small_value = left_pointer
            left_pointer -= 1

        while (
            right_pointer != -1
            and right_pointer < len(nums)
            and nums[right_pointer] == target
        ):
            big_value = right_pointer
            right_pointer += 1

        return [small_value, big_value]