leetcode

349. Intersection of Two Arrays

Map Solution

Time complexity: O(m + n)

Space complexity: O(min(m, n))

Two Pointers Solution

Time complexity: O(m log(m) + n log(n))

Space complexity: O(1)