MediumArray· 56% acceptance
#192

Two Sum 42

Medium

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

Example 1

Input: nums = [2,27,24,35,6,46], target = 73

Output: [1,5]

nums[1] + nums[5] = 73

Constraints

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

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

twoSum

← All practice problems