EasyArray· 75% acceptance
#214

Two Sum 64

Easy

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

Example 1

Input: nums = [24,43,6,17,28,39,10,0], target = 43

Output: [1,7]

nums[1] + nums[7] = 43

Constraints

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

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

twoSum

← All practice problems