...

/

Solution: Intersection of Two Arrays

Solution: Intersection of Two Arrays

Let’s solve the Intersection of Two Arrays problem using the Hash Map pattern.

Statement

You are given two integer arrays, arr1 and arr2. Your task is to return a new array containing the intersection of both arrays.

  • Each element in the result must be unique.

  • The order of the elements in the result does not matter.

Constraints

  • 11 \leq arr1.length, arr2.length 1000\leq 1000

  • 00 \leqarr1[i], arr2[i] 1000 ...