Leetcode Problem 1 Two Sum.txt

1. Two Sum
Given an array of integers, return indices of the two numbers such that they add up to a 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].

class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        
        numMap = {}
        for index,num in enumerate(nums):
            remaining = target - num
            if remaining in numMap:
                return [numMap[remaining], index]
            else:
                numMap[num] = index
        
        return []