Two Sum

Easy

ArrayHash TableAcceptance 52.4%

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

Example 1

Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Explanation: nums[0] + nums[1] == 9, so we return [0, 1].

Example 2

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

Constraints

• 2 <= nums.length <= 10^4
• -10^9 <= nums[i] <= 10^9
• Only one valid answer exists.

solution.js

JavaScript (Node 20)

Run or submit your code to see results here.