Dataford
Interview QuestionsInterview GuidesExperiencesMock InterviewsPricing
Get started
Find Two Sum Indices
00:00
5 left

Find Two Sum Indices

EasyPython

Problem

Problem Statement

At Lyft, you are given an integer array and a target value. Return the indices of the two distinct elements whose sum equals the target.

Formal Specification

Implement a function two_sum(nums, target) where:

  • nums is a list of integers
  • target is an integer
  • Return a list of two integers [i, j] such that nums[i] + nums[j] == target
  • You may assume exactly one valid answer exists
  • You may not use the same element twice
  • Return the indices in any order

Constraints

  • 2 <= len(nums) <= 10^4
  • -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):
Interviewer

Your question is Find Two Sum Indices. Start with the requirements in the Question tab.

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.
CodePython 3
You need to log in / sign up to run or submit.Ln 2
Run your code to see test output here.