use one pointer p starts from list end and travels backwards. 32 ms run time
def twoSum(self, numbers, target):
for i, n in enumerate(numbers):
while p>i and numbers[p]>target-n:
Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.