Two Sum
EasyGiven 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: nums = [2,7,11,15], target = 9
Output: [0,1]
Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].
Input: nums = [3,2,4], target = 6
Output: [1,2]
Input: nums = [3,3], target = 6
Output: [0,1]
Constraints
- Time complexity matters. Can you solve it in O(n) time?
- Consider edge cases such as empty inputs or extreme values.
- Optimize your solution for readability and maintainability.
// Write your solution here
function solution() {
// Your code here
}
Tips
- • Consider using a hash map for efficient lookups
- • Think about the time vs. space tradeoffs
- • Can you solve it in a single pass?