EasyArray· 72% acceptance
#194

Two Sum 44

Easy

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

Example 1

Input: nums = [4,33,26,37,8,19,30,10], target = 43

Output: [1,7]

nums[1] + nums[7] = 43

Constraints

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

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

twoSum

← All practice problems