Implement Two Sum | Dataford Interview Questions

Write a function to implement the two-sum problem.

Given an integer array nums and integer target, return the indices of two distinct elements whose values add up to target. Assume exactly one solution exists, and return the indices in ascending order.

Contract

Implement two_sum(nums, target). Return a list containing the two zero-based indices.

Constraints

2 <= len(nums) <= 1000
-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):

Whenever you're ready, walk me through your approach or go straight to the code. The requirements are in the Question tab.

Problem

Write a function to implement the two-sum problem.

Contract

Implement two_sum(nums, target). Return a list containing the two zero-based indices.

Constraints

2 <= len(nums) <= 1000
-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):

Whenever you're ready, walk me through your approach or go straight to the code. The requirements are in the Question tab.