Two-Sum Target Achievability | Dataford Interview Questions

Given an array of integers, write a program to find if a specific target sum can be achieved using two elements.

Implement def has_pair_with_sum(nums, target):. Return True if two distinct elements sum to target; otherwise return False. Each array element may be used at most once.

Input and Output

nums is a list of integers and target is an integer. Return a Boolean.

Constraints

0 <= nums.length <= 10^4
-10^9 <= nums[i] <= 10^9
-10^9 <= target <= 10^9
Only distinct array positions may be used

Function Signature

def has_pair_with_sum(nums, target):

Your question is Two-Sum Target Achievability. 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