EasyArray· 78% acceptance
#200

Two Sum 50

Easy

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

Example 1

Input: nums = [10,1,32,3,14,25,36,7,18,29,0,11,22,2], target = 3

Output: [1,13]

nums[1] + nums[13] = 3

Constraints

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

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

twoSum

← All practice problems