Given two arrays $\text{nums1}$ and $\text{nums2}$, return a list $[\text{answer1}, \text{answer2}]$ where $\text{answer1}$ contains all distinct integers in $\text{nums1}$ but not in $\text{nums2}$, and $\text{answer2}$ contains all distinct integers in $\text{nums2}$ but not in $\text{nums1}$.
For example, if $\text{nums1} = [1, 2, 3]$ and $\text{nums2} = [2, 4, 6]$, then $\text{answer1} = [1, 3]$ and $\text{answer2} = [4, 6]$.
This is the set difference operation applied twice. Try solving it before reading on.