EasyArray· 76% acceptance
#181

Two Sum 31

Easy

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

Example 1

Input: nums = [31,44,13,24,35,6,17,28,39,10,21,32,3,14,19], target = 63

Output: [0,11]

nums[0] + nums[11] = 63

Constraints

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

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

twoSum

← All practice problems