Two Sum
Implement twoSum
Given an array of integers
nums and an integer target, return the indicesIndicesThe position of each element within the array, starting at 0 for the first element. of the two numbers that add up to target.
You may assume that each input has exactly one solution, and you may not use the same element twice. You can return the answer in any order.Example 1:
Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Example 2:
Input: nums = [3,2,4], target = 6
Output: [1,2]
Example 3:
Input: nums = [3,3], target = 6
Output: [0,1]
+ 15 hidden test cases run on Submit.
Constraints:
- ●
2 ≤ nums.length ≤ 10⁴ - ●
-10⁹ ≤ nums[i] ≤ 10⁹ - ●
-10⁹ ≤ target ≤ 10⁹ - ●
Only one valid answer exists
nums =
[2, 7, 11, 15]
target =
9