¬ just serendipity 🍀 (not just serendipity)

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

        while left <= right:
            ## mid = (left + right) // 2
            mid = left + (right - left) // 2
            assert 0 <= mid < len(nums)

            if nums[mid] == target:
                return mid
            elif nums[mid] < target:
                left = mid + 1
            else: ## nums[mid] > target:
                right = mid - 1

        return left if (0 <= left < len(nums)) and nums[left] == target else -1

import bisect

class Solution:
    def search(self, nums: List[int], target: int) -> int:
        index = bisect.bisect_left(nums, target)
        if index >= len(nums):
            return -1
        return index if nums[index] == target else -1

import bisect

class Solution:
    def search(self, nums: List[int], target: int) -> int:
        def bsearch(left, right, target):
            ## if not 0 <= left <= right < len(nums):
            ##     return -1
            if left > right:
                return -1

            mid = left + (right - left) // 2

            if nums[mid] == target:
                return mid
            elif nums[mid] < target:
                return bsearch(mid + 1, right, target)
            else:  ## nums[mid] > target
                return bsearch(left, mid - 1, target)

        return bsearch(0, len(nums) - 1, target)