MediumArray· 63% acceptance
#165

Two Sum 15

Medium

Given `nums` and `target`, return indices of two distinct numbers that add up to `target`. Exactly one solution exists. Variant **#15**.

Example 1

Input: nums = [15,46,37,8,19,30,1,12,23,34,5,16,27,38,9,20,31,2,7], target = 53

Output: [0,13]

nums[0] + nums[13] = 53

Constraints

  • 2 <= nums.length <= 10^4
  • Each input has exactly one solution

Acceptance: 63% · Topics: array, hash-table

twoSum

← All practice problems