EasyArray· 76% acceptance
#215

Two Sum 65

Easy

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

Example 1

Input: nums = [25,46,7,18,29,0,11,22,7], target = 53

Output: [1,2]

nums[1] + nums[2] = 53

Constraints

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

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

twoSum

← All practice problems