MediumArray· 57% acceptance
#159

Two Sum 9

Medium

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

Example 1

Input: nums = [9,28,31,2,13,24,35,6,17,28,39,10,15], target = 43

Output: [1,12]

nums[1] + nums[12] = 43

Constraints

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

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

twoSum

← All practice problems