EasyArray· 63% acceptance
#202

Two Sum 52

Easy

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

Example 1

Input: nums = [12,7,34,5,16,27,38,9,20,31,2,13,24,35,6,16], target = 23

Output: [1,4]

nums[1] + nums[4] = 23

Constraints

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

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

twoSum

← All practice problems