Problem - Intersection of Two Arrays

Given two arrays $\text{nums1}$ and $\text{nums2}$, return an array of their intersection. Each element in the result must be unique and you can return the result in any order.

For example, if $\text{nums1} = [1, 2, 2, 1]$ and $\text{nums2} = [2, 2]$, the answer is $[2]$.

This is a direct application of set intersection. Before reading the solution, think about how you would find common elements between two collections.