EasyArray· 67% acceptance
#155

Two Sum 5

Easy

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

Example 1

Input: nums = [5,16,27,38,9,20,31,2,37], target = 53

Output: [1,8]

nums[1] + nums[8] = 53

Constraints

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

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

twoSum

← All practice problems