Two Sum

EasyHashMap

Description

Given an array of integers `nums` and an integer `target`, return **indices** of the two numbers such that they add up to `target`. You may assume that each input would have **exactly one solution**, and you may not use the same element twice.

Examples

Input: nums = [2,7,11,15], target = 9

Output: [0,1]

nums[0] + nums[1] = 2 + 7 = 9

Input: nums = [3,2,4], target = 6

Output: [1,2]

Constraints

  • •2 ≤ nums.length ≤ 10⁴
  • •-10⁹ ≤ nums[i] ≤ 10⁹
  • •Only one valid answer exists

Your Solution

JavaScript·4 test cases·Max 5,000 chars · 2s timeout · 10 runs/30s
Loading...