Two sum - Leet Code Solution

Deepak Raj - Jul 31 '20 - - Dev Community

Two sum - Leet Code Solution

Topic: Two Sum Problem

Problem Statement:

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

You can find the original question here -> Two Sum Problem

Two sum - Leet code solution in Python Language.

class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        seen = {}

        for index, num in enumerate(nums):
            other = target - num 

            if other in  seen:
                return[seen[other],index]
            else:
                seen[num] = index
        return []
Enter fullscreen mode Exit fullscreen mode

Share Your Solutions?

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Terabox Video Player