MediumArray· 52% acceptance
#171

Two Sum 21

Medium

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

Example 1

Input: nums = [21,14,3,14,49], target = 63

Output: [1,4]

nums[1] + nums[4] = 63

Constraints

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

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

twoSum

← All practice problems