EasyArray· 75% acceptance
#197

Two Sum 47

Easy

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

Example 1

Input: nums = [7,42,29,0,11,22,33,4,15,26,31], target = 73

Output: [1,10]

nums[1] + nums[10] = 73

Constraints

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

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

twoSum

← All practice problems