EasyArray· 66% acceptance
#154

Two Sum 4

Easy

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

Example 1

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

Output: [1,6]

nums[1] + nums[6] = 43

Constraints

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

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

twoSum

← All practice problems