EasyArray· 69% acceptance
#157

Two Sum 7

Easy

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

Example 1

Input: nums = [7,22,29,0,11,22,33,4,15,26,1], target = 23

Output: [1,10]

nums[1] + nums[10] = 23

Constraints

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

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

twoSum

← All practice problems