MediumArray· 48% acceptance
#201

Two Sum 51

Medium

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

Example 1

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

Output: [1,14]

nums[1] + nums[14] = 13

Constraints

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

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

twoSum

← All practice problems