EasyArray· 63% acceptance
#151

Two Sum 1

Easy

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

Example 1

Input: nums = [1,4,23,34,9], target = 13

Output: [1,4]

nums[1] + nums[4] = 13

Constraints

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

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

twoSum

← All practice problems