Solving the Two-Sum Problem

EasyPython00:00

Practice interviewer

In session

5 left

00:00

Your question is Solving the Two-Sum 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

An Egis Group engineering service needs to identify two indexed measurements whose combined value equals a specified target. Given an integer array and a target integer, return the indices of the two distinct elements whose values sum to the target.

You may assume that every valid input contains exactly one solution. Return the indices in ascending order, and do not use the same array element twice.

Formal Specification

Implement two_sum(nums, target).

Input: nums, a list of integers, and target, an integer.
Output: A list containing exactly two integer indices [i, j], where i < j and nums[i] + nums[j] == target.

Constraints

2 <= len(nums) <= 10^4
-10^9 <= nums[i] <= 10^9
-10^9 <= target <= 10^9
Exactly one pair of distinct indices produces the target sum

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