Two Sum

Two Sum - LeetCode

 

1) Brute Forcetime   time complexity O(n^2)

class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        for i, num in enumerate(nums):
            rest = target - num
            if rest > 0:
                for j, num in enumerate(nums):
                    if i!=j and num == rest:
                        return [i, j]

 

2) Hash Map time complexity O(n)