Two Sum Equals K

EasyPython00:00

Practice interviewer

In session

5 left

00:00

Your question is Two Sum Equals K. Start with the requirements on the right.

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

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

Problem

Simon AI analyzes numeric signals generated by its products. Given an array of integers and a target value k, determine whether two distinct elements in the array add up to k.

Return True if such a pair exists, or False otherwise. The same array element cannot be used twice, but duplicate values at different indices may form a valid pair.

Formal Specification

Implement has_pair_with_sum(nums, k):

Input: nums, a list of integers, and k, an integer target.
Output: A boolean indicating whether two distinct indices i and j satisfy nums[i] + nums[j] == k.
The order of the elements does not matter.
If no valid pair exists, return False.

Constraints

2 <= len(nums) <= 100,000
-10^9 <= nums[i] <= 10^9
-10^9 <= k <= 10^9
Elements may be duplicated
The same array position cannot be used twice

Function Signature

def has_pair_with_sum(nums, k):

Your solutionPython 3

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

Run your code to see test output