EasyArray· 67% acceptance
#172

Two Sum 22

Easy

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

Example 1

Input: nums = [22,17,4,15,26,6], target = 23

Output: [1,5]

nums[1] + nums[5] = 23

Constraints

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

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

twoSum

← All practice problems