leetcode

350. Intersection of Two Arrays II

Map solution

• Python code
• Java code

Time complexity: O(m + n)

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

Two Pointers Solution

• Python code
• Java code

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

Space complexity: O(1)

Binary search solution code

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

Space complexity: O(1)