2-Sum on Sorted Array

EasyPython

Problem

Solve the 2-sum problem given a sorted array with potential duplicates.

Implement two_sum_sorted(nums, target) and return the two distinct indices [i, j] where nums[i] + nums[j] == target. Return [-1, -1] if no pair exists. The array is sorted in nondecreasing order, and when multiple pairs exist, return any valid pair.

Constraints

2 <= nums.length <= 1000
-10^9 <= nums[i] <= 10^9
nums is sorted in nondecreasing order
The two indices must be distinct
Return any valid pair when multiple pairs exist

Function Signature

def two_sum_sorted(nums, target):

CodePython 3

You need to log in / sign up to run or submit.Ln 2

Run your code to see test output here.