EasyArray· 68% acceptance
#190

Two Sum 40

Easy

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

Example 1

Input: nums = [0,21,22,32], target = 53

Output: [1,3]

nums[1] + nums[3] = 53

Constraints

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

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

twoSum

← All practice problems