Two Sum

Given an array of integers, return indices of the two numbers such that they add up to specific target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

Example:

Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,

return [0, 1].

Solution:

def twoSum(nums, target):

dic = {}

if len(nums) <= 1:

return False

for k in range(len(nums)):

if nums[k] in dic:

return [dic[nums[k]],k]

else:

dic[target - nums[k]] = k


#optimal_Solution #python #data_structure