Dataford
Interview QuestionsInterview GuidesExperiencesMock InterviewsPricing
Get started

2Sum With Hash Map

EasyPython00:00
Practice interviewer
In session
5 left
00:00

Your question is 2Sum 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

A Cerebras data-processing pipeline receives an unsorted array of integer measurements. Given nums and an integer target, return the indices of two distinct elements whose values sum to target.

Use a hash map to avoid checking every pair. Return the indices in ascending order of discovery. 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 list containing the two distinct zero-based indices whose values sum to target.

Constraints

  • 2 <= len(nums) <= 100,000
  • -10^9 <= nums[i] <= 10^9
  • -10^9 <= target <= 10^9
  • Exactly one valid pair exists
  • The same index 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