Two Pointers

def two_pointers_search(nums: list[int], target: int) -> list[int]:
    # Prerequisite: array must be sorted
    left, right = 0, len(nums) - 1
    
    while left < right:
        curr_sum = nums[left] + nums[right]
        if curr_sum == target:
            return [left, right]
        elif curr_sum < target:
            left += 1   # Need larger sum -> move left inward
        else:
            right -= 1  # Need smaller sum -> move right inward
            
    return []