easyArrays & Hashing
Two Sum
## Problem
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.
You can return the answer in any order.
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.
You can return the answer in any order.
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]
nums[1] + nums[2] = 2 + 4 = 6
Constraints
2 <= nums.length <= 10^4
-10^9 <= nums[i] <= 10^9
-10^9 <= target <= 10^9
Only one valid answer exists.
Python
Loading...