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 \leq$ arr1.length, arr2.length $\leq 1000$

• $0 \leq$arr1[i], arr2[i] $\leq 1000$

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.