# https://leetcode.com/problems/two-sum/

class Solution:
    def twoSum(self, num, target):
        map = {}
        for i in range(len(num)):
            if num[i] not in map:
                map[target - num[i]] = i
            else:
			#remember its returning index of the elements
                return map[num[i]], i
        return -1, -1
# https://leetcode.com/problems/two-sum/

class Solution:
    def twoSum(self, num, target):
        map = {}
        for i in range(len(num)):
            if num[i] not in map:
                map[target - num[i]] = i
            else:
			#remember its returning index of the elements
                return map[num[i]], i
        return -1, -1
# https://leetcode.com/problems/two-sum/ #remember its returning index of the elements