EasyArray· 78% acceptance
#217

Two Sum 67

Easy

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

Example 1

Input: nums = [27,2,9,20,31,2,13,24,35,6,21], target = 23

Output: [1,10]

nums[1] + nums[10] = 23

Constraints

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

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

twoSum

← All practice problems