Two Sum - Challenge
Two Sum
EasyProblem
Given an array of integers
Assume exactly one solution and you may not use the same element twice.
nums and an integer target, return the indices of the two numbers such that they add up to target.Assume exactly one solution and you may not use the same element twice.
Constraints
- 2 <= nums.length <= 10^4
- -10^9 <= nums[i] <= 10^9
- -10^9 <= target <= 10^9
- Return any valid pair of indices in non-decreasing order.
Sample Tests
Test 1
Input
nums = [2, 7, 11, 15], target = 9
Expected
[0, 1]
2 + 7 = 9
Test 2
Input
nums = [3, 2, 4], target = 6
Expected
[1, 2]
Test 3
Input
nums = [3, 3], target = 6
Expected
[0, 1]
Console
Run tests to see verdicts.