Algorithm
Two Sum
Solution
class Solution:
def twoSum(self, nums: List[int], target: int) -> List[int]:
seen = {}
for i, num in enumerate(nums):
complement = target - num
if complement in seen:
return [seen[complement], i]
seen[num] = iVideo GuideLeetcode Daily
Time Complexity
O(N)
Space Complexity
O(N)
