EasyArray· 71% acceptance
#176

Two Sum 26

Easy

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

Example 1

Input: nums = [26,29,8,19,30,1,12,23,34,34], target = 63

Output: [1,8]

nums[1] + nums[8] = 63

Constraints

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

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

twoSum

← All practice problems