Two Sum Pair Finder | Dataford Interview Questions

Find the first pair in an array that sums to a specific target number.

Implement def first_pair_sum(nums, target):. Return the two zero-based indices in ascending order. Scan from left to right, and return the first pair whose second index is encountered; if no pair exists, return []. Each array element may be used at most once. The input is an integer array and an integer target, and the output is a two-element list of integers or an empty list.

Constraints

2 <= len(nums) <= 10^4
-10^9 <= nums[i] <= 10^9
-10^9 <= target <= 10^9
Each element may be used at most once

Function Signature

def first_pair_sum(nums, target):

Your question is Two Sum Pair Finder. 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

Find the first pair in an array that sums to a specific target number.

Constraints

2 <= len(nums) <= 10^4
-10^9 <= nums[i] <= 10^9
-10^9 <= target <= 10^9
Each element may be used at most once

Function Signature

def first_pair_sum(nums, target):

Your question is Two Sum Pair Finder. 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.