Two-Sum K Check | Dataford Interview Questions

During Sony BRAVIA firmware validation, two measured values may need to combine to a required calibration value K. Given an integer array and an integer K, determine whether two elements at different positions add up exactly to K.

You may use each array position at most once, but duplicate values at different positions are allowed. Return True if such a pair exists; otherwise, return False.

Formal Specification

Implement has_pair_sum(nums, k).

Input: nums, a list of integers, and k, an integer target sum.
Output: A Boolean indicating whether there are indices i and j such that i != j and nums[i] + nums[j] == k.
The order of the two values does not matter.

Constraints

2 <= len(nums) <= 100,000
-10^9 <= nums[i] <= 10^9
-10^9 <= k <= 10^9
Duplicate values are allowed
A pair must use two distinct array positions

Function Signature

def has_pair_sum(nums, k):

Your question is Two-Sum K Check. 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