MediumArray· 58% acceptance
#177

Two Sum 27

Medium

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

Example 1

Input: nums = [27,32,9,20,31,2,13,24,35,6,41], target = 73

Output: [1,10]

nums[1] + nums[10] = 73

Constraints

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

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

twoSum

← All practice problems