EasyArray· 77% acceptance
#199

Two Sum 49

Easy

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

Example 1

Input: nums = [9,48,31,2,13,24,35,6,17,28,39,10,45], target = 93

Output: [1,12]

nums[1] + nums[12] = 93

Constraints

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

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

twoSum

← All practice problems