EasyArray· 77% acceptance
#182

Two Sum 32

Easy

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

Example 1

Input: nums = [32,47,14,25,36,7,18,29,0,11,22,33,4,15,26,26], target = 73

Output: [1,14]

nums[1] + nums[14] = 73

Constraints

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

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

twoSum

← All practice problems