EasyArray· 73% acceptance
#212

Two Sum 62

Easy

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

Example 1

Input: nums = [22,37,4,15,26,36], target = 73

Output: [1,5]

nums[1] + nums[5] = 73

Constraints

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

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

twoSum

← All practice problems