Tap here to switch tabs
Problem
Submissions

Problem: Intersection of Two Arrays

Intersection of Two Arrays asks you to return the unique integers that appear in both input arrays, with the result in any order and without duplicate values.

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

  • 1≤1 \leq arr1.length, arr2.length ≤1000\leq 1000

  • 0≤0 \leqarr1[i], arr2[i] ≤1000\leq 1000

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Intersection of Two Arrays

Intersection of Two Arrays asks you to return the unique integers that appear in both input arrays, with the result in any order and without duplicate values.

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

  • 1≤1 \leq arr1.length, arr2.length ≤1000\leq 1000

  • 0≤0 \leqarr1[i], arr2[i] ≤1000\leq 1000