For a given integer list, nums, which might contain duplicates, return all possible unique permutations derived from nums.

Note: The order in which the permutations appear doesn’t matter.

Constraints:

• $1 \leq$ nums.length $\leq 8$

• $-10 \leq$ nums[i] $\leq 10$