subsetsWithDup = function(nums) {
    nums.sort((a, b) => a - b);

    return dfs(nums);
}
https://leetcode.com/problems/subsets-ii/
Time O(N * 2^N) | Space O(N)
@param {number[]} nums
@return {number[][]}