Question

Intuition

Classic binary search problem

Approach

Complexity

• Time complexity: $$O(log\ n)$$

• Space complexity: $$O(1)$$

Code

class Solution:
    def search(self, nums: List[int], target: int) -> int:
        low, high = 0, len(nums) - 1
        while (low <= high):
            mid = (low + high) // 2
            if nums[mid] == target:
                return mid
            elif nums[mid] > target:
                high = mid - 1
            else:
                low = mid + 1
        return -1
        

Result