Given a collection of integers that might contain duplicates, nums, return all possible subsets (the power set).
Input: nums = [1, 2, 3]
Output: [[3], [1], [2], [1, 2, 3], [1, 3], [2, 3], [1, 2], []]- The solution set must not contain duplicate subsets.