EasyArray· 64% acceptance
#220

Two Sum 70

Easy

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

Example 1

Input: nums = [30,11,12,23,34,5,16,27,38,9,20,31,2,42], target = 53

Output: [0,3]

nums[0] + nums[3] = 53

Constraints

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

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

twoSum

← All practice problems