MediumArray· 64% acceptance
#183

Two Sum 33

Medium

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

Example 1

Input: nums = [33,0,15,26,37,8,19,30,1,12,23,34,5,16,27,38,33], target = 33

Output: [0,1]

nums[0] + nums[1] = 33

Constraints

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

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

twoSum

← All practice problems