Search⌘ K
AI Features

Solution: Intersection of Two Arrays

Understand how to find the unique intersection of two arrays by using a hash map to track elements from the first array and identify common values in the second. This lesson guides you through designing a solution that avoids redundant comparisons, ensuring each element is processed once for optimal performance.

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 ...