EasyArray· 74% acceptance
#179

Two Sum 29

Easy

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

Example 1

Input: nums = [29,38,11,22,33,4,15,26,37,8,19,30,5], target = 43

Output: [1,12]

nums[1] + nums[12] = 43

Constraints

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

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

twoSum

← All practice problems