EasyArray· 68% acceptance
#173

Two Sum 23

Easy

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

Example 1

Input: nums = [23,20,5,16,27,38,13], target = 33

Output: [1,6]

nums[1] + nums[6] = 33

Constraints

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

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

twoSum

← All practice problems