EasyArray· 78% acceptance
#166

Two Sum 16

Easy

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

Example 1

Input: nums = [16,49,38,9,20,31,2,13,24,35,6,17,28,39,10,21,32,3,14,14], target = 63

Output: [1,18]

nums[1] + nums[18] = 63

Constraints

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

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

twoSum

← All practice problems