Two Sum Coding Challenge | Dataford Interview Questions

Belay Technologies needs to identify two values in an integer sequence whose combined value matches a requested target. Given an array nums and an integer target, return the indices of the two distinct elements whose values sum to target.

Use a single element at most once. You may assume every valid input contains exactly one solution. Return the indices in ascending order of their position in the array.

Formal Specification

Input: nums, a list of integers, and target, an integer.
Output: A list containing the two indices [i, j] where i < j and nums[i] + nums[j] == target.
Function: Implement two_sum(nums, target).

Constraints

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

Function Signature

def two_sum(nums, target):

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