2-Sum on Sorted Array | Dataford Interview Questions

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):

Your question is 2-Sum on Sorted Array. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

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

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):

Your question is 2-Sum on Sorted Array. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.