EasyArray· 71% acceptance
#193

Two Sum 43

Easy

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

Example 1

Input: nums = [3,30,25,36,7,18,3], target = 33

Output: [0,1]

nums[0] + nums[1] = 33

Constraints

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

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

twoSum

← All practice problems