[Leet Code] 349. Intersection of Two Array

class Solution:
    def intersection(self, nums1: List[int], nums2: List[int]) -> List[int]:
        arr = []
        nums1 = set(nums1); nums2 = set(nums2)

        for num in nums1:
            if num in nums2:
                arr.append(num)
        return arr