In a Google coding interview, you are given an integer array nums and an integer target. Return the indices of the two distinct elements whose values add up to target.
You may assume there is exactly one valid answer, and you may not use the same element twice. The array is not sorted.
nums: a list of integerstarget: an integer[i, j] such that nums[i] + nums[j] == target and i != jExample 1
nums = [2, 7, 11, 15], target = 9[0, 1]nums[0] + nums[1] = 2 + 7 = 9Example 2
nums = [3, 2, 4], target = 6[1, 2]nums[1] + nums[2] = 2 + 4 = 6Example 3
nums = [3, 3], target = 6[0, 1]3 values are at different indices, so both can be used.2 <= len(nums) <= 10^5-10^9 <= nums[i] <= 10^9-10^9 <= target <= 10^9