1. Two Sum

[giscus[bot]]

1. Two Sum

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

https://xjasonlyu.github.io/leetcode/1.two-sum/

[xjasonlyu]

Solution based on hash table:

class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        seen = {}
        for i, value in enumerate(nums):
            remaining = target - nums[i]
           
            if remaining in seen:
               return [i, seen[remaining]]
            
            seen[value] = i

[xjasonlyu]

• Time complexity: O(n)
• Space complexity: O(n)