Two Sum with Hash Map

EasyPython00:00

Practice interviewer

In session

5 left

00:00

Your question is Two Sum with Hash Map. 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

Given an array of integers nums and an integer target, return the indices of the two distinct elements whose values add up to target. Return the answer as a list of two indices in any order. You may assume exactly one valid pair exists.

Constraints

2 <= len(nums) <= 10^5
-10^9 <= nums[i] <= 10^9
-10^9 <= target <= 10^9
Exactly one valid answer exists
You may not use the same element 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