MediumArray· 54% acceptance
#207

Two Sum 57

Medium

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

Example 1

Input: nums = [17,22,39,10,21,32,3,14,25,36,7,18,29,0,11,22,33,4,15,26,1], target = 23

Output: [1,20]

nums[1] + nums[20] = 23

Constraints

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

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

twoSum

← All practice problems