MediumArray· 57% acceptance
#210

Two Sum 60

Medium

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

Example 1

Input: nums = [20,31,2,22], target = 53

Output: [1,3]

nums[1] + nums[3] = 53

Constraints

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

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

twoSum

← All practice problems