Two Sum
Easy
Array
Hash Table
Two Pointers
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:
[[2,7,11,15],9]Output:
[0,1]Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].
Input:
[[3,2,4],6]Output:
[1,2]Constraints:
- 2 ≤ nums.length ≤ 10⁴
- -10⁹ ≤ nums[i] ≤ 10⁹
- -10⁹ ≤ target ≤ 10⁹
- Only one valid answer exists.
Code Editor
Loading advanced editor...
Console Output
Ready to execute
Click "Run Code" to see your output here