167. Two-Sum-II-Input-Array-is-Sorted

class Solution:
    def twoSum(self, numbers: List[int], target: int) -> List[int]:
        hash_map = {}
        for index, value in enumerate(numbers):
            if (target - value) in hash_map:
                return [hash_map[target-value] + 1,index + 1]
            hash_map[value] = index
        return [-1, -1]



class Solution:
    def twoSum(self, numbers: List[int], target: int) -> List[int]:
        left = 0
        right = len(numbers) - 1
        while left < right:
            if numbers[left] + numbers[right] == target:
                return [left + 1, right + 1]
            elif numbers[left] + numbers[right] > target:
                right -= 1
            else:
                left += 1
        return [-1,-1]