EasyArray· 62% acceptance
#184

Two Sum 34

Easy

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

Example 1

Input: nums = [34,3,16,27,38,9,20,31,2,13,24,35,6,17,28,39,10,40], target = 43

Output: [0,5]

nums[0] + nums[5] = 43

Constraints

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

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

twoSum

← All practice problems