Easy Algo

Learn data structures and algorithms through clear illustrations and examples. From basics to advanced, master algorithmic thinking effortlessly.

Start Learning

# Two Sum - LeetCode #1# Time: O(n), Space: O(n)class Solution:
def twoSum(self, nums: List[int], target: int) -> List[int]:
hash_map = {}
for i, num in enumerate(nums):
complement = target - num
if complement in hash_map:
return [hash_map[complement], i]
hash_map[num] = i
return []