Question

Intuition

Approach

Complexity

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

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

Code

class Solution:
    def search(self, nums: List[int], target: int) -> bool:
        low, high = 0, len(nums) - 1
        while low <= high:
            mid = (low + high) // 2
            if nums[mid] == target:
                return True
            # Can't determine which half is sorted
            if nums[low] == nums[mid] == nums[high]:
                low += 1
                high -= 1
            # Left half is cleanly sorted
            elif nums[low] <= nums[mid]:
                if nums[low] <= target < nums[mid]:
                    high = mid - 1
                else:
                    low = mid + 1
            # Right half is cleanly sorted
            else:
                if nums[mid] < target <= nums[high]:
                    low = mid + 1
                else:
                    high = mid - 1
        return False

Result