two_sum_ii.py

class Solution:
    def twoSum(self, numbers: List[int], target: int) -> List[int]:
        
        l, r = 0 , len(numbers) -1
        while l < r:  #the fact that list is sorted means left will not overlap r
            currSum = numbers[l] + numbers[r] # 
            
            if currSum > target:
                r -= 1
            elif currSum < target:
                l += 1
            else:
                return [l + 1 , r + 1] # return none zero based indices