Array Duplicates and Two-Sum | Dataford Interview Questions

Solve an array-based problem, such as finding duplicate elements or identifying pairs that sum to a specific target.

Implement two_sum(nums, target) to return the indices of the two distinct elements whose values add up to target. Each valid input contains exactly one solution, and the returned indices must be in their original array order. Return an empty list only if no pair exists.

Input: an integer list nums and integer target. Output: a two-element list of indices.

Constraints

2 <= nums.length <= 10^4
-10^9 <= nums[i] <= 10^9
-10^9 <= target <= 10^9
The two indices must be distinct
Each valid input contains exactly one solution

Function Signature

def two_sum(nums, target):

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

Solve an array-based problem, such as finding duplicate elements or identifying pairs that sum to a specific target.

Input: an integer list nums and integer target. Output: a two-element list of indices.

Constraints

2 <= nums.length <= 10^4
-10^9 <= nums[i] <= 10^9
-10^9 <= target <= 10^9
The two indices must be distinct
Each valid input contains exactly one solution

Function Signature

def two_sum(nums, target):

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