EasyArray· 72% acceptance
#211

Two Sum 61

Easy

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

Example 1

Input: nums = [21,34,3,14,29], target = 63

Output: [1,4]

nums[1] + nums[4] = 63

Constraints

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

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

twoSum

← All practice problems