Two-Sum Array Problem

EasyPython00:00

Practice interviewer

In session

5 left

00:00

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

You need to log in / sign up to run or submit.

Problem

Within a CEVA Logistics shipment planning workflow, two scanned shipment values may need to be checked against a required combined 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 ascending order. Each input is guaranteed to contain exactly one valid pair, and the same array element cannot be used twice.

Formal Specification

Implement two_sum(nums, target):

Input: nums, a list of integers, and target, an integer.
Output: A two-element list containing the zero-based indices of the matching values in ascending order.

Constraints

2 <= len(nums) <= 100,000
-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 solutionPython 3

You need to log in / sign up to run or submit.

Run your code to see test output