EasyArray· 72% acceptance
#160

Two Sum 10

Easy

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

Example 1

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

Output: [1,12]

nums[1] + nums[12] = 53

Constraints

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

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

twoSum

← All practice problems