Two Sum Coding Problem | Dataford Interview Questions

In an Antra coding assessment, identify two distinct values in an integer array whose sum equals a specified target. Return the zero-based indices of those values using an approach that runs in linear time.

You may assume that every valid input contains exactly one solution. The same array element cannot be used twice. The returned indices may be in any order, although the examples use increasing order.

Formal Specification

Implement two_sum(nums, target).

Input: nums, a list of integers, and target, an integer.
Output: A list containing the two zero-based indices i and j such that nums[i] + nums[j] == target and i != j.
If no pair exists, return an empty list. This case will not occur for valid inputs.

Constraints

2 <= len(nums) <= 10^5
-10^9 <= nums[i] <= 10^9
-10^9 <= target <= 10^9
Exactly one valid pair exists
The same array index cannot be used twice

Function Signature

def two_sum(nums, target):

Your question is Two Sum Coding Problem. 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