EasyArray· 64% acceptance
#169

Two Sum 19

Easy

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

Example 1

Input: nums = [19,8,1,12,23,34,5,16,27,38,9,20,31,2,13,24,35,6,17,28,39,10,35], target = 43

Output: [0,15]

nums[0] + nums[15] = 43

Constraints

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

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

twoSum

← All practice problems