Facebook PixelTwo Sum — Coding Practice
Two SumEasy

Two Sum

Easy 41.2k52% acceptance
ArrayHash Table

Given an array of integers nums and an integer target, return the indices of the two numbers that add up to target.

You may assume that each input has exactly one solution, and you may not use the same element twice. Return the answer with the smaller index first.

Example 1
Input: nums = [2,7,11,15], target = 9
Output: [0,1]
nums[0] + nums[1] = 2 + 7 = 9.
Example 2
Input: nums = [3,2,4], target = 6
Output: [1,2]
Constraints
  • 2 ≤ nums.length ≤ 10⁴
  • -10⁹ ≤ nums[i] ≤ 10⁹
  • Exactly one valid answer exists.
Asked atGoogleAmazonAppleMeta
JavaScript
Loading editor…
Case 1
[2,7,11,15], 9
expected: [0,1]
Case 2
[3,2,4], 6
expected: [1,2]
Case 3
[3,3], 6
expected: [0,1]
Case 4
[-1,-2,-3,-4,-5], -8
expected: [2,4]