Two Sum Array Target | Dataford Interview Questions

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

Problem

While processing numeric events in a HashedIn by Deloitte engineering workflow, you need to identify whether two recorded values produce a required target total. Given an integer array nums and an integer target, return the indices of two distinct elements whose values add up to target.

Return the indices in any order. You may assume that every valid input contains exactly one solution, and the same array element cannot be used twice.

Formal Specification

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

Constraints

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

Function Signature

def two_sum(nums, target):