Loading problem…
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.
Example 1
Input: nums = [4,7,1,3,5,8,2,9,6], target = 12
Output: [1,4]
Explanation: nums[1] + nums[4] = 7 + 5 = 12, so we return [1,4]. No other pair of indices adds up to 12.
Example 2
Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Explanation: nums[0] + nums[1] = 2 + 7 = 9, so we return [0,1].
Example 3
Input: nums = [3,2,4], target = 6
Output: [1,2]
Explanation: nums[1] + nums[2] = 2 + 4 = 6. The single 3 cannot be used twice, so [0,0] is not allowed.
Use a hash map to store each number's index. For each number, check if the complement (target - num) already exists in the map.
Run checks all cases above. Submit evaluates all test cases.