EasyArray· 73% acceptance
#161

Two Sum 11

Easy

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

Example 1

Input: nums = [11,34,33,4,15,26,37,8,19,30,1,12,23,34,29], target = 63

Output: [1,14]

nums[1] + nums[14] = 63

Constraints

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

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

twoSum

← All practice problems