Given an array of integers nums and an integer target, return the indices 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. Return the indices in any order.
Important: Your solution must run in O(n) time. A brute-force O(n²) solution that checks every pair will be too slow for large inputs.
Hint: Think about what data structure gives you O(1) lookups.
nums = [2, 7, 11, 15], target = 9[0, 1]nums = [3, 2, 4], target = 6[1, 2]nums = [3, 3], target = 6[0, 1]2 <= nums.length <= 10^5-10^9 <= nums[i] <= 10^9-10^9 <= target <= 10^9Exactly one solution existsExpected time complexity: O(n)Run your code to see results
Use Cmd+Enter to run