class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        diff = []
        hashmap = {}
        for i in range(0,len(nums)):
            if nums[i] not in hashmap:
                hashmap[nums[i]] = []
                hashmap[nums[i]].append(i)
            else:
                hashmap[nums[i]].append(i)
            diff.append(target - nums[i])
        j = 0
        for i in diff:
            #check equal corner case
            if i in hashmap:
                if nums[hashmap[i][0]]==i:
                    if len(hashmap[i])>=2:
                        return [hashmap[i][0],hashmap[i][1]]

                if j!=hashmap[i][0]:
                    return [j,hashmap[i][0]]
            j+=1
        # for i in range(0,len(nums)):
        #     for j in range(i+1, len(nums)):
        #         if nums[i]+nums[j] == target:
        #             return [i,j]
        return []