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

Largest palindrome product - Project Euler Solution
Deepak Raj ・ Aug 1 '20
#challenge #python #computerscience #algorithms
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 []
Share Your Solutions?
Top comments (0)