MediumArray· 62% acceptance
#198

Two Sum 48

Medium

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

Example 1

Input: nums = [8,45,30,1,12,23,34,5,16,27,38,38], target = 83

Output: [1,10]

nums[1] + nums[10] = 83

Constraints

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

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

twoSum

← All practice problems